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_10.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:49:21,407 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:49:21,409 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:49:21,421 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:49:21,421 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:49:21,422 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:49:21,424 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:49:21,426 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:49:21,427 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:49:21,428 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:49:21,429 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:49:21,431 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:49:21,431 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:49:21,432 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:49:21,433 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:49:21,434 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:49:21,435 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:49:21,436 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:49:21,438 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:49:21,440 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:49:21,442 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:49:21,443 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:49:21,444 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:49:21,445 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:49:21,447 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:49:21,447 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:49:21,448 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:49:21,449 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:49:21,449 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:49:21,450 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:49:21,450 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:49:21,451 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:49:21,452 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:49:21,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:49:21,454 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:49:21,454 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:49:21,455 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:49:21,455 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:49:21,455 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:49:21,456 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:49:21,457 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:49:21,458 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-09 05:49:21,473 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:49:21,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:49:21,474 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:49:21,474 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:49:21,475 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:49:21,475 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:49:21,475 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:49:21,476 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:49:21,476 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:49:21,476 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:49:21,477 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:49:21,477 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:49:21,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:49:21,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:49:21,478 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:49:21,478 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:49:21,478 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:49:21,478 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:49:21,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:49:21,479 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:49:21,479 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:49:21,479 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:49:21,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:49:21,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:49:21,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:49:21,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:49:21,480 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:49:21,480 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:49:21,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:49:21,481 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:49:21,510 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:49:21,523 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:49:21,527 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:49:21,528 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:49:21,529 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:49:21,531 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_10.c [2019-09-09 05:49:21,608 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7b48da82/424924b0b62d483b99c63b845a1cf8f4/FLAG6c96567b1 [2019-09-09 05:49:22,060 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:49:22,061 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10.c [2019-09-09 05:49:22,069 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7b48da82/424924b0b62d483b99c63b845a1cf8f4/FLAG6c96567b1 [2019-09-09 05:49:22,476 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7b48da82/424924b0b62d483b99c63b845a1cf8f4 [2019-09-09 05:49:22,491 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:49:22,493 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:49:22,496 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:49:22,496 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:49:22,501 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:49:22,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:49:22" (1/1) ... [2019-09-09 05:49:22,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63f255d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:22, skipping insertion in model container [2019-09-09 05:49:22,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:49:22" (1/1) ... [2019-09-09 05:49:22,513 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:49:22,547 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:49:22,756 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:49:22,766 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:49:22,826 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:49:22,841 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:49:22,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:22 WrapperNode [2019-09-09 05:49:22,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:49:22,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:49:22,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:49:22,842 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:49:22,943 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:22" (1/1) ... [2019-09-09 05:49:22,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:22" (1/1) ... [2019-09-09 05:49:22,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:22" (1/1) ... [2019-09-09 05:49:22,951 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:22" (1/1) ... [2019-09-09 05:49:22,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:22" (1/1) ... [2019-09-09 05:49:22,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:22" (1/1) ... [2019-09-09 05:49:22,966 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:22" (1/1) ... [2019-09-09 05:49:22,970 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:49:22,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:49:22,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:49:22,976 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:49:22,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:22" (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-09 05:49:23,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:49:23,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:49:23,046 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:49:23,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:49:23,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:49:23,047 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:49:23,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:49:23,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:49:23,440 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:49:23,440 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:49:23,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:49:23 BoogieIcfgContainer [2019-09-09 05:49:23,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:49:23,443 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:49:23,443 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:49:23,447 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:49:23,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:49:22" (1/3) ... [2019-09-09 05:49:23,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57815cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:49:23, skipping insertion in model container [2019-09-09 05:49:23,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:22" (2/3) ... [2019-09-09 05:49:23,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57815cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:49:23, skipping insertion in model container [2019-09-09 05:49:23,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:49:23" (3/3) ... [2019-09-09 05:49:23,450 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2019-09-09 05:49:23,460 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:49:23,469 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:49:23,485 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:49:23,512 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:49:23,513 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:49:23,513 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:49:23,513 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:49:23,513 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:49:23,514 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:49:23,514 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:49:23,514 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:49:23,531 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-09-09 05:49:23,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-09 05:49:23,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:23,543 INFO L399 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-09 05:49:23,545 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:23,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:23,552 INFO L82 PathProgramCache]: Analyzing trace with hash -917347053, now seen corresponding path program 1 times [2019-09-09 05:49:23,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:23,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:23,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:23,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:23,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:23,738 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-09 05:49:23,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:23,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:23,741 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:23,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:23,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:23,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:23,764 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-09-09 05:49:23,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:23,823 INFO L93 Difference]: Finished difference Result 80 states and 137 transitions. [2019-09-09 05:49:23,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:23,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-09 05:49:23,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:23,839 INFO L225 Difference]: With dead ends: 80 [2019-09-09 05:49:23,840 INFO L226 Difference]: Without dead ends: 72 [2019-09-09 05:49:23,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:23,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-09 05:49:23,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-09-09 05:49:23,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-09 05:49:23,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 89 transitions. [2019-09-09 05:49:23,892 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 89 transitions. Word has length 20 [2019-09-09 05:49:23,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:23,893 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 89 transitions. [2019-09-09 05:49:23,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:23,893 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 89 transitions. [2019-09-09 05:49:23,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-09 05:49:23,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:23,895 INFO L399 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-09 05:49:23,895 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:23,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:23,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1504153067, now seen corresponding path program 1 times [2019-09-09 05:49:23,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:23,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:23,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:23,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:23,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:23,985 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-09 05:49:23,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:23,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:23,986 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:23,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:23,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:23,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:23,989 INFO L87 Difference]: Start difference. First operand 50 states and 89 transitions. Second operand 3 states. [2019-09-09 05:49:24,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:24,045 INFO L93 Difference]: Finished difference Result 72 states and 126 transitions. [2019-09-09 05:49:24,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:24,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-09 05:49:24,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:24,047 INFO L225 Difference]: With dead ends: 72 [2019-09-09 05:49:24,048 INFO L226 Difference]: Without dead ends: 72 [2019-09-09 05:49:24,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:24,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-09 05:49:24,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-09-09 05:49:24,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-09 05:49:24,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 125 transitions. [2019-09-09 05:49:24,075 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 125 transitions. Word has length 20 [2019-09-09 05:49:24,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:24,076 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 125 transitions. [2019-09-09 05:49:24,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:24,077 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 125 transitions. [2019-09-09 05:49:24,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-09 05:49:24,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:24,081 INFO L399 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-09 05:49:24,081 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:24,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:24,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1627225809, now seen corresponding path program 1 times [2019-09-09 05:49:24,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:24,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:24,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:24,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:24,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:24,168 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-09 05:49:24,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:24,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:24,170 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:24,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:24,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:24,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:24,171 INFO L87 Difference]: Start difference. First operand 70 states and 125 transitions. Second operand 3 states. [2019-09-09 05:49:24,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:24,213 INFO L93 Difference]: Finished difference Result 75 states and 128 transitions. [2019-09-09 05:49:24,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:24,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-09 05:49:24,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:24,216 INFO L225 Difference]: With dead ends: 75 [2019-09-09 05:49:24,216 INFO L226 Difference]: Without dead ends: 75 [2019-09-09 05:49:24,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:24,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-09 05:49:24,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-09-09 05:49:24,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-09 05:49:24,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 127 transitions. [2019-09-09 05:49:24,239 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 127 transitions. Word has length 21 [2019-09-09 05:49:24,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:24,239 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 127 transitions. [2019-09-09 05:49:24,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:24,240 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2019-09-09 05:49:24,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-09 05:49:24,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:24,241 INFO L399 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-09 05:49:24,243 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:24,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:24,243 INFO L82 PathProgramCache]: Analyzing trace with hash 616108559, now seen corresponding path program 1 times [2019-09-09 05:49:24,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:24,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:24,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:24,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:24,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:24,308 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-09 05:49:24,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:24,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:24,308 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:24,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:24,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:24,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:24,310 INFO L87 Difference]: Start difference. First operand 73 states and 127 transitions. Second operand 3 states. [2019-09-09 05:49:24,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:24,343 INFO L93 Difference]: Finished difference Result 134 states and 237 transitions. [2019-09-09 05:49:24,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:24,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-09 05:49:24,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:24,345 INFO L225 Difference]: With dead ends: 134 [2019-09-09 05:49:24,346 INFO L226 Difference]: Without dead ends: 134 [2019-09-09 05:49:24,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:24,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-09 05:49:24,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2019-09-09 05:49:24,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-09 05:49:24,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 168 transitions. [2019-09-09 05:49:24,356 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 168 transitions. Word has length 21 [2019-09-09 05:49:24,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:24,356 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 168 transitions. [2019-09-09 05:49:24,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:24,357 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 168 transitions. [2019-09-09 05:49:24,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-09 05:49:24,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:24,358 INFO L399 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-09 05:49:24,358 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:24,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:24,359 INFO L82 PathProgramCache]: Analyzing trace with hash 29302545, now seen corresponding path program 1 times [2019-09-09 05:49:24,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:24,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:24,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:24,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:24,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:24,419 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-09 05:49:24,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:24,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:24,419 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:24,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:24,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:24,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:24,422 INFO L87 Difference]: Start difference. First operand 96 states and 168 transitions. Second operand 3 states. [2019-09-09 05:49:24,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:24,449 INFO L93 Difference]: Finished difference Result 136 states and 235 transitions. [2019-09-09 05:49:24,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:24,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-09 05:49:24,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:24,455 INFO L225 Difference]: With dead ends: 136 [2019-09-09 05:49:24,456 INFO L226 Difference]: Without dead ends: 136 [2019-09-09 05:49:24,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:24,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-09 05:49:24,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2019-09-09 05:49:24,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-09-09 05:49:24,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 234 transitions. [2019-09-09 05:49:24,476 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 234 transitions. Word has length 21 [2019-09-09 05:49:24,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:24,480 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 234 transitions. [2019-09-09 05:49:24,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:24,481 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 234 transitions. [2019-09-09 05:49:24,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-09 05:49:24,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:24,482 INFO L399 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-09 05:49:24,483 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:24,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:24,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1919709866, now seen corresponding path program 1 times [2019-09-09 05:49:24,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:24,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:24,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:24,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:24,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:24,549 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-09 05:49:24,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:24,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:24,549 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:24,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:24,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:24,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:24,552 INFO L87 Difference]: Start difference. First operand 134 states and 234 transitions. Second operand 3 states. [2019-09-09 05:49:24,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:24,581 INFO L93 Difference]: Finished difference Result 138 states and 235 transitions. [2019-09-09 05:49:24,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:24,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-09 05:49:24,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:24,584 INFO L225 Difference]: With dead ends: 138 [2019-09-09 05:49:24,584 INFO L226 Difference]: Without dead ends: 138 [2019-09-09 05:49:24,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:24,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-09 05:49:24,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-09-09 05:49:24,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-09 05:49:24,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 234 transitions. [2019-09-09 05:49:24,606 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 234 transitions. Word has length 22 [2019-09-09 05:49:24,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:24,607 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 234 transitions. [2019-09-09 05:49:24,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:24,607 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 234 transitions. [2019-09-09 05:49:24,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-09 05:49:24,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:24,609 INFO L399 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-09 05:49:24,611 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:24,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:24,612 INFO L82 PathProgramCache]: Analyzing trace with hash 908592616, now seen corresponding path program 1 times [2019-09-09 05:49:24,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:24,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:24,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:24,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:24,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:24,670 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-09 05:49:24,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:24,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:24,671 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:24,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:24,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:24,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:24,678 INFO L87 Difference]: Start difference. First operand 136 states and 234 transitions. Second operand 3 states. [2019-09-09 05:49:24,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:24,706 INFO L93 Difference]: Finished difference Result 250 states and 435 transitions. [2019-09-09 05:49:24,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:24,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-09 05:49:24,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:24,711 INFO L225 Difference]: With dead ends: 250 [2019-09-09 05:49:24,712 INFO L226 Difference]: Without dead ends: 250 [2019-09-09 05:49:24,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:24,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-09-09 05:49:24,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 184. [2019-09-09 05:49:24,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-09 05:49:24,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 314 transitions. [2019-09-09 05:49:24,738 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 314 transitions. Word has length 22 [2019-09-09 05:49:24,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:24,739 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 314 transitions. [2019-09-09 05:49:24,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:24,739 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 314 transitions. [2019-09-09 05:49:24,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-09 05:49:24,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:24,744 INFO L399 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-09 05:49:24,744 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:24,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:24,745 INFO L82 PathProgramCache]: Analyzing trace with hash 321786602, now seen corresponding path program 1 times [2019-09-09 05:49:24,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:24,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:24,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:24,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:24,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:24,794 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-09 05:49:24,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:24,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:24,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:24,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:24,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:24,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:24,799 INFO L87 Difference]: Start difference. First operand 184 states and 314 transitions. Second operand 3 states. [2019-09-09 05:49:24,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:24,822 INFO L93 Difference]: Finished difference Result 258 states and 435 transitions. [2019-09-09 05:49:24,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:24,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-09 05:49:24,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:24,825 INFO L225 Difference]: With dead ends: 258 [2019-09-09 05:49:24,825 INFO L226 Difference]: Without dead ends: 258 [2019-09-09 05:49:24,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:24,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-09-09 05:49:24,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-09-09 05:49:24,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-09 05:49:24,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 434 transitions. [2019-09-09 05:49:24,842 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 434 transitions. Word has length 22 [2019-09-09 05:49:24,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:24,844 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 434 transitions. [2019-09-09 05:49:24,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:24,844 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 434 transitions. [2019-09-09 05:49:24,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-09 05:49:24,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:24,851 INFO L399 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-09 05:49:24,852 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:24,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:24,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1898185914, now seen corresponding path program 1 times [2019-09-09 05:49:24,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:24,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:24,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:24,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:24,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:24,898 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-09 05:49:24,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:24,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:24,899 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:24,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:24,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:24,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:24,901 INFO L87 Difference]: Start difference. First operand 256 states and 434 transitions. Second operand 3 states. [2019-09-09 05:49:24,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:24,915 INFO L93 Difference]: Finished difference Result 262 states and 435 transitions. [2019-09-09 05:49:24,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:24,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-09 05:49:24,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:24,918 INFO L225 Difference]: With dead ends: 262 [2019-09-09 05:49:24,918 INFO L226 Difference]: Without dead ends: 262 [2019-09-09 05:49:24,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:24,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-09-09 05:49:24,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2019-09-09 05:49:24,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:49:24,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 434 transitions. [2019-09-09 05:49:24,931 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 434 transitions. Word has length 23 [2019-09-09 05:49:24,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:24,931 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 434 transitions. [2019-09-09 05:49:24,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:24,932 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 434 transitions. [2019-09-09 05:49:24,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-09 05:49:24,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:24,938 INFO L399 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-09 05:49:24,938 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:24,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:24,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1385664132, now seen corresponding path program 1 times [2019-09-09 05:49:24,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:24,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:24,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:24,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:24,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:24,988 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-09 05:49:24,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:24,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:24,988 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:24,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:24,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:24,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:24,990 INFO L87 Difference]: Start difference. First operand 260 states and 434 transitions. Second operand 3 states. [2019-09-09 05:49:25,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:25,018 INFO L93 Difference]: Finished difference Result 474 states and 799 transitions. [2019-09-09 05:49:25,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:25,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-09 05:49:25,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:25,023 INFO L225 Difference]: With dead ends: 474 [2019-09-09 05:49:25,023 INFO L226 Difference]: Without dead ends: 474 [2019-09-09 05:49:25,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-09-09 05:49:25,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 360. [2019-09-09 05:49:25,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-09-09 05:49:25,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 590 transitions. [2019-09-09 05:49:25,042 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 590 transitions. Word has length 23 [2019-09-09 05:49:25,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:25,045 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 590 transitions. [2019-09-09 05:49:25,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:25,046 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 590 transitions. [2019-09-09 05:49:25,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-09 05:49:25,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:25,047 INFO L399 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-09 05:49:25,048 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:25,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:25,048 INFO L82 PathProgramCache]: Analyzing trace with hash 798858118, now seen corresponding path program 1 times [2019-09-09 05:49:25,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:25,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:25,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:25,078 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-09 05:49:25,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:25,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:25,079 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:25,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:25,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:25,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,081 INFO L87 Difference]: Start difference. First operand 360 states and 590 transitions. Second operand 3 states. [2019-09-09 05:49:25,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:25,103 INFO L93 Difference]: Finished difference Result 498 states and 807 transitions. [2019-09-09 05:49:25,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:25,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-09 05:49:25,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:25,109 INFO L225 Difference]: With dead ends: 498 [2019-09-09 05:49:25,109 INFO L226 Difference]: Without dead ends: 498 [2019-09-09 05:49:25,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-09-09 05:49:25,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2019-09-09 05:49:25,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-09-09 05:49:25,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 806 transitions. [2019-09-09 05:49:25,123 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 806 transitions. Word has length 23 [2019-09-09 05:49:25,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:25,123 INFO L475 AbstractCegarLoop]: Abstraction has 496 states and 806 transitions. [2019-09-09 05:49:25,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:25,124 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 806 transitions. [2019-09-09 05:49:25,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-09 05:49:25,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:25,126 INFO L399 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-09 05:49:25,126 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:25,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:25,126 INFO L82 PathProgramCache]: Analyzing trace with hash 6129535, now seen corresponding path program 1 times [2019-09-09 05:49:25,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:25,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:25,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:25,160 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-09 05:49:25,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:25,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:25,161 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:25,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:25,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:25,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,162 INFO L87 Difference]: Start difference. First operand 496 states and 806 transitions. Second operand 3 states. [2019-09-09 05:49:25,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:25,177 INFO L93 Difference]: Finished difference Result 506 states and 807 transitions. [2019-09-09 05:49:25,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:25,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-09 05:49:25,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:25,181 INFO L225 Difference]: With dead ends: 506 [2019-09-09 05:49:25,181 INFO L226 Difference]: Without dead ends: 506 [2019-09-09 05:49:25,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-09-09 05:49:25,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2019-09-09 05:49:25,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-09-09 05:49:25,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 806 transitions. [2019-09-09 05:49:25,195 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 806 transitions. Word has length 24 [2019-09-09 05:49:25,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:25,195 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 806 transitions. [2019-09-09 05:49:25,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:25,196 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 806 transitions. [2019-09-09 05:49:25,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-09 05:49:25,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:25,197 INFO L399 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-09 05:49:25,197 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:25,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:25,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1004987715, now seen corresponding path program 1 times [2019-09-09 05:49:25,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:25,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:25,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:25,227 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-09 05:49:25,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:25,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:25,228 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:25,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:25,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:25,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,229 INFO L87 Difference]: Start difference. First operand 504 states and 806 transitions. Second operand 3 states. [2019-09-09 05:49:25,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:25,249 INFO L93 Difference]: Finished difference Result 906 states and 1463 transitions. [2019-09-09 05:49:25,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:25,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-09 05:49:25,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:25,255 INFO L225 Difference]: With dead ends: 906 [2019-09-09 05:49:25,255 INFO L226 Difference]: Without dead ends: 906 [2019-09-09 05:49:25,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2019-09-09 05:49:25,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 712. [2019-09-09 05:49:25,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-09-09 05:49:25,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1110 transitions. [2019-09-09 05:49:25,274 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1110 transitions. Word has length 24 [2019-09-09 05:49:25,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:25,274 INFO L475 AbstractCegarLoop]: Abstraction has 712 states and 1110 transitions. [2019-09-09 05:49:25,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:25,274 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1110 transitions. [2019-09-09 05:49:25,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-09 05:49:25,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:25,276 INFO L399 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-09 05:49:25,276 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:25,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:25,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1591793729, now seen corresponding path program 1 times [2019-09-09 05:49:25,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:25,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:25,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:25,294 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-09 05:49:25,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:25,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:25,294 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:25,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:25,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:25,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,295 INFO L87 Difference]: Start difference. First operand 712 states and 1110 transitions. Second operand 3 states. [2019-09-09 05:49:25,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:25,314 INFO L93 Difference]: Finished difference Result 970 states and 1495 transitions. [2019-09-09 05:49:25,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:25,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-09 05:49:25,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:25,320 INFO L225 Difference]: With dead ends: 970 [2019-09-09 05:49:25,320 INFO L226 Difference]: Without dead ends: 970 [2019-09-09 05:49:25,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2019-09-09 05:49:25,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 968. [2019-09-09 05:49:25,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-09-09 05:49:25,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1494 transitions. [2019-09-09 05:49:25,342 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1494 transitions. Word has length 24 [2019-09-09 05:49:25,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:25,342 INFO L475 AbstractCegarLoop]: Abstraction has 968 states and 1494 transitions. [2019-09-09 05:49:25,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:25,342 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1494 transitions. [2019-09-09 05:49:25,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-09 05:49:25,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:25,344 INFO L399 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-09 05:49:25,345 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:25,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:25,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1089633349, now seen corresponding path program 1 times [2019-09-09 05:49:25,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:25,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:25,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:25,362 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-09 05:49:25,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:25,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:25,363 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:25,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:25,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:25,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,364 INFO L87 Difference]: Start difference. First operand 968 states and 1494 transitions. Second operand 3 states. [2019-09-09 05:49:25,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:25,381 INFO L93 Difference]: Finished difference Result 986 states and 1495 transitions. [2019-09-09 05:49:25,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:25,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-09 05:49:25,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:25,386 INFO L225 Difference]: With dead ends: 986 [2019-09-09 05:49:25,387 INFO L226 Difference]: Without dead ends: 986 [2019-09-09 05:49:25,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2019-09-09 05:49:25,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 984. [2019-09-09 05:49:25,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-09-09 05:49:25,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1494 transitions. [2019-09-09 05:49:25,409 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1494 transitions. Word has length 25 [2019-09-09 05:49:25,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:25,410 INFO L475 AbstractCegarLoop]: Abstraction has 984 states and 1494 transitions. [2019-09-09 05:49:25,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:25,410 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1494 transitions. [2019-09-09 05:49:25,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-09 05:49:25,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:25,412 INFO L399 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-09 05:49:25,412 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:25,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:25,412 INFO L82 PathProgramCache]: Analyzing trace with hash -2100750599, now seen corresponding path program 1 times [2019-09-09 05:49:25,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:25,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:25,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:25,439 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-09 05:49:25,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:25,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:25,440 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:25,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:25,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:25,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,441 INFO L87 Difference]: Start difference. First operand 984 states and 1494 transitions. Second operand 3 states. [2019-09-09 05:49:25,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:25,465 INFO L93 Difference]: Finished difference Result 1738 states and 2663 transitions. [2019-09-09 05:49:25,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:25,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-09 05:49:25,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:25,474 INFO L225 Difference]: With dead ends: 1738 [2019-09-09 05:49:25,474 INFO L226 Difference]: Without dead ends: 1738 [2019-09-09 05:49:25,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-09-09 05:49:25,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1416. [2019-09-09 05:49:25,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2019-09-09 05:49:25,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2086 transitions. [2019-09-09 05:49:25,510 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2086 transitions. Word has length 25 [2019-09-09 05:49:25,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:25,511 INFO L475 AbstractCegarLoop]: Abstraction has 1416 states and 2086 transitions. [2019-09-09 05:49:25,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:25,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2086 transitions. [2019-09-09 05:49:25,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-09 05:49:25,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:25,514 INFO L399 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-09 05:49:25,515 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:25,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:25,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1607410683, now seen corresponding path program 1 times [2019-09-09 05:49:25,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:25,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:25,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:25,545 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-09 05:49:25,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:25,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:25,547 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:25,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:25,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:25,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,548 INFO L87 Difference]: Start difference. First operand 1416 states and 2086 transitions. Second operand 3 states. [2019-09-09 05:49:25,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:25,573 INFO L93 Difference]: Finished difference Result 1898 states and 2759 transitions. [2019-09-09 05:49:25,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:25,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-09 05:49:25,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:25,582 INFO L225 Difference]: With dead ends: 1898 [2019-09-09 05:49:25,582 INFO L226 Difference]: Without dead ends: 1898 [2019-09-09 05:49:25,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2019-09-09 05:49:25,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1896. [2019-09-09 05:49:25,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2019-09-09 05:49:25,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2758 transitions. [2019-09-09 05:49:25,644 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2758 transitions. Word has length 25 [2019-09-09 05:49:25,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:25,644 INFO L475 AbstractCegarLoop]: Abstraction has 1896 states and 2758 transitions. [2019-09-09 05:49:25,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:25,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2758 transitions. [2019-09-09 05:49:25,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-09 05:49:25,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:25,647 INFO L399 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-09 05:49:25,648 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:25,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:25,648 INFO L82 PathProgramCache]: Analyzing trace with hash -698544044, now seen corresponding path program 1 times [2019-09-09 05:49:25,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:25,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:25,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:25,677 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-09 05:49:25,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:25,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:25,678 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:25,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:25,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:25,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,679 INFO L87 Difference]: Start difference. First operand 1896 states and 2758 transitions. Second operand 3 states. [2019-09-09 05:49:25,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:25,705 INFO L93 Difference]: Finished difference Result 1930 states and 2759 transitions. [2019-09-09 05:49:25,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:25,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-09 05:49:25,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:25,715 INFO L225 Difference]: With dead ends: 1930 [2019-09-09 05:49:25,715 INFO L226 Difference]: Without dead ends: 1930 [2019-09-09 05:49:25,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2019-09-09 05:49:25,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1928. [2019-09-09 05:49:25,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2019-09-09 05:49:25,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2758 transitions. [2019-09-09 05:49:25,757 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2758 transitions. Word has length 26 [2019-09-09 05:49:25,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:25,757 INFO L475 AbstractCegarLoop]: Abstraction has 1928 states and 2758 transitions. [2019-09-09 05:49:25,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:25,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2758 transitions. [2019-09-09 05:49:25,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-09 05:49:25,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:25,761 INFO L399 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-09 05:49:25,762 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:25,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:25,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1709661294, now seen corresponding path program 1 times [2019-09-09 05:49:25,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:25,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:25,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:25,790 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-09 05:49:25,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:25,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:25,791 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:25,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:25,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:25,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,794 INFO L87 Difference]: Start difference. First operand 1928 states and 2758 transitions. Second operand 3 states. [2019-09-09 05:49:25,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:25,830 INFO L93 Difference]: Finished difference Result 3338 states and 4807 transitions. [2019-09-09 05:49:25,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:25,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-09 05:49:25,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:25,850 INFO L225 Difference]: With dead ends: 3338 [2019-09-09 05:49:25,850 INFO L226 Difference]: Without dead ends: 3338 [2019-09-09 05:49:25,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2019-09-09 05:49:25,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2824. [2019-09-09 05:49:25,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2824 states. [2019-09-09 05:49:25,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 3910 transitions. [2019-09-09 05:49:25,917 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 3910 transitions. Word has length 26 [2019-09-09 05:49:25,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:25,918 INFO L475 AbstractCegarLoop]: Abstraction has 2824 states and 3910 transitions. [2019-09-09 05:49:25,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:25,918 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 3910 transitions. [2019-09-09 05:49:25,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-09 05:49:25,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:25,923 INFO L399 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-09 05:49:25,924 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:25,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:25,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1998499988, now seen corresponding path program 1 times [2019-09-09 05:49:25,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:25,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:25,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:25,942 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-09 05:49:25,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:25,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:25,943 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:25,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:25,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:25,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,944 INFO L87 Difference]: Start difference. First operand 2824 states and 3910 transitions. Second operand 3 states. [2019-09-09 05:49:25,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:25,985 INFO L93 Difference]: Finished difference Result 3722 states and 5063 transitions. [2019-09-09 05:49:25,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:25,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-09 05:49:25,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:26,003 INFO L225 Difference]: With dead ends: 3722 [2019-09-09 05:49:26,003 INFO L226 Difference]: Without dead ends: 3722 [2019-09-09 05:49:26,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:26,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2019-09-09 05:49:26,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3720. [2019-09-09 05:49:26,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3720 states. [2019-09-09 05:49:26,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 5062 transitions. [2019-09-09 05:49:26,079 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 5062 transitions. Word has length 26 [2019-09-09 05:49:26,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:26,079 INFO L475 AbstractCegarLoop]: Abstraction has 3720 states and 5062 transitions. [2019-09-09 05:49:26,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:26,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 5062 transitions. [2019-09-09 05:49:26,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-09 05:49:26,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:26,086 INFO L399 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-09 05:49:26,086 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:26,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:26,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1459677136, now seen corresponding path program 1 times [2019-09-09 05:49:26,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:26,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:26,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:26,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:26,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:26,106 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-09 05:49:26,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:26,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:26,106 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:26,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:26,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:26,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:26,108 INFO L87 Difference]: Start difference. First operand 3720 states and 5062 transitions. Second operand 3 states. [2019-09-09 05:49:26,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:26,135 INFO L93 Difference]: Finished difference Result 3786 states and 5063 transitions. [2019-09-09 05:49:26,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:26,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-09 05:49:26,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:26,152 INFO L225 Difference]: With dead ends: 3786 [2019-09-09 05:49:26,152 INFO L226 Difference]: Without dead ends: 3786 [2019-09-09 05:49:26,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:26,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2019-09-09 05:49:26,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2019-09-09 05:49:26,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-09-09 05:49:26,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5062 transitions. [2019-09-09 05:49:26,226 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5062 transitions. Word has length 27 [2019-09-09 05:49:26,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:26,227 INFO L475 AbstractCegarLoop]: Abstraction has 3784 states and 5062 transitions. [2019-09-09 05:49:26,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:26,227 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5062 transitions. [2019-09-09 05:49:26,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-09 05:49:26,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:26,233 INFO L399 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-09 05:49:26,234 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:26,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:26,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1824172910, now seen corresponding path program 1 times [2019-09-09 05:49:26,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:26,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:26,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:26,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:26,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:26,251 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-09 05:49:26,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:26,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:26,252 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:26,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:26,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:26,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:26,253 INFO L87 Difference]: Start difference. First operand 3784 states and 5062 transitions. Second operand 3 states. [2019-09-09 05:49:26,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:26,323 INFO L93 Difference]: Finished difference Result 7306 states and 9351 transitions. [2019-09-09 05:49:26,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:26,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-09 05:49:26,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:26,352 INFO L225 Difference]: With dead ends: 7306 [2019-09-09 05:49:26,353 INFO L226 Difference]: Without dead ends: 7306 [2019-09-09 05:49:26,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:26,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2019-09-09 05:49:26,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7304. [2019-09-09 05:49:26,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2019-09-09 05:49:26,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9350 transitions. [2019-09-09 05:49:26,484 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9350 transitions. Word has length 27 [2019-09-09 05:49:26,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:26,484 INFO L475 AbstractCegarLoop]: Abstraction has 7304 states and 9350 transitions. [2019-09-09 05:49:26,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:26,484 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9350 transitions. [2019-09-09 05:49:26,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-09 05:49:26,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:26,495 INFO L399 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-09 05:49:26,495 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:26,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:26,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1883988372, now seen corresponding path program 1 times [2019-09-09 05:49:26,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:26,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:26,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:26,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:26,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:26,513 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-09 05:49:26,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:26,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:26,514 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:26,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:26,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:26,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:26,515 INFO L87 Difference]: Start difference. First operand 7304 states and 9350 transitions. Second operand 3 states. [2019-09-09 05:49:26,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:26,548 INFO L93 Difference]: Finished difference Result 8074 states and 10503 transitions. [2019-09-09 05:49:26,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:26,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-09 05:49:26,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:26,566 INFO L225 Difference]: With dead ends: 8074 [2019-09-09 05:49:26,566 INFO L226 Difference]: Without dead ends: 8074 [2019-09-09 05:49:26,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:26,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2019-09-09 05:49:26,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 7304. [2019-09-09 05:49:26,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2019-09-09 05:49:26,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9222 transitions. [2019-09-09 05:49:26,707 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9222 transitions. Word has length 27 [2019-09-09 05:49:26,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:26,707 INFO L475 AbstractCegarLoop]: Abstraction has 7304 states and 9222 transitions. [2019-09-09 05:49:26,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:26,707 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9222 transitions. [2019-09-09 05:49:26,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-09 05:49:26,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:26,719 INFO L399 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, 1] [2019-09-09 05:49:26,719 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:26,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:26,720 INFO L82 PathProgramCache]: Analyzing trace with hash 715001129, now seen corresponding path program 1 times [2019-09-09 05:49:26,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:26,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:26,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:26,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:26,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:26,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:26,738 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-09 05:49:26,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:26,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:26,739 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:26,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:26,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:26,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:26,740 INFO L87 Difference]: Start difference. First operand 7304 states and 9222 transitions. Second operand 3 states. [2019-09-09 05:49:26,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:26,781 INFO L93 Difference]: Finished difference Result 12170 states and 15239 transitions. [2019-09-09 05:49:26,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:26,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-09 05:49:26,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:26,879 INFO L225 Difference]: With dead ends: 12170 [2019-09-09 05:49:26,879 INFO L226 Difference]: Without dead ends: 12170 [2019-09-09 05:49:26,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:26,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2019-09-09 05:49:27,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 11144. [2019-09-09 05:49:27,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2019-09-09 05:49:27,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 13702 transitions. [2019-09-09 05:49:27,039 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 13702 transitions. Word has length 28 [2019-09-09 05:49:27,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:27,040 INFO L475 AbstractCegarLoop]: Abstraction has 11144 states and 13702 transitions. [2019-09-09 05:49:27,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:27,040 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 13702 transitions. [2019-09-09 05:49:27,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-09 05:49:27,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:27,058 INFO L399 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, 1] [2019-09-09 05:49:27,059 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:27,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:27,059 INFO L82 PathProgramCache]: Analyzing trace with hash 128195115, now seen corresponding path program 1 times [2019-09-09 05:49:27,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:27,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:27,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:27,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:27,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:27,075 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-09 05:49:27,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:27,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:27,076 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:27,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:27,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:27,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:27,077 INFO L87 Difference]: Start difference. First operand 11144 states and 13702 transitions. Second operand 3 states. [2019-09-09 05:49:27,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:27,122 INFO L93 Difference]: Finished difference Result 14218 states and 16903 transitions. [2019-09-09 05:49:27,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:27,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-09 05:49:27,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:27,150 INFO L225 Difference]: With dead ends: 14218 [2019-09-09 05:49:27,150 INFO L226 Difference]: Without dead ends: 14218 [2019-09-09 05:49:27,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:27,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states. [2019-09-09 05:49:27,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14218 to 14216. [2019-09-09 05:49:27,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2019-09-09 05:49:27,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 16902 transitions. [2019-09-09 05:49:27,360 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 16902 transitions. Word has length 28 [2019-09-09 05:49:27,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:27,360 INFO L475 AbstractCegarLoop]: Abstraction has 14216 states and 16902 transitions. [2019-09-09 05:49:27,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:27,360 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 16902 transitions. [2019-09-09 05:49:27,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-09 05:49:27,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:27,382 INFO L399 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, 1, 1] [2019-09-09 05:49:27,382 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:27,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:27,383 INFO L82 PathProgramCache]: Analyzing trace with hash 690414627, now seen corresponding path program 1 times [2019-09-09 05:49:27,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:27,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:27,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:27,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:27,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:27,402 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-09 05:49:27,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:27,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:27,403 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:27,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:27,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:27,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:27,404 INFO L87 Difference]: Start difference. First operand 14216 states and 16902 transitions. Second operand 3 states. [2019-09-09 05:49:27,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:27,529 INFO L93 Difference]: Finished difference Result 14602 states and 17159 transitions. [2019-09-09 05:49:27,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:27,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-09 05:49:27,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:27,553 INFO L225 Difference]: With dead ends: 14602 [2019-09-09 05:49:27,554 INFO L226 Difference]: Without dead ends: 14602 [2019-09-09 05:49:27,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:27,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14602 states. [2019-09-09 05:49:27,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14602 to 14600. [2019-09-09 05:49:27,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14600 states. [2019-09-09 05:49:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 17158 transitions. [2019-09-09 05:49:27,729 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 17158 transitions. Word has length 29 [2019-09-09 05:49:27,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:27,729 INFO L475 AbstractCegarLoop]: Abstraction has 14600 states and 17158 transitions. [2019-09-09 05:49:27,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:27,730 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 17158 transitions. [2019-09-09 05:49:27,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-09 05:49:27,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:27,750 INFO L399 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, 1, 1] [2019-09-09 05:49:27,750 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:27,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:27,751 INFO L82 PathProgramCache]: Analyzing trace with hash -320702623, now seen corresponding path program 1 times [2019-09-09 05:49:27,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:27,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:27,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:27,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:27,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:27,766 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-09 05:49:27,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:27,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:27,767 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:27,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:27,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:27,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:27,768 INFO L87 Difference]: Start difference. First operand 14600 states and 17158 transitions. Second operand 3 states. [2019-09-09 05:49:27,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:27,828 INFO L93 Difference]: Finished difference Result 23560 states and 26886 transitions. [2019-09-09 05:49:27,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:27,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-09 05:49:27,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:27,871 INFO L225 Difference]: With dead ends: 23560 [2019-09-09 05:49:27,871 INFO L226 Difference]: Without dead ends: 23560 [2019-09-09 05:49:27,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:27,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23560 states. [2019-09-09 05:49:28,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23560 to 22536. [2019-09-09 05:49:28,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22536 states. [2019-09-09 05:49:28,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22536 states to 22536 states and 25862 transitions. [2019-09-09 05:49:28,562 INFO L78 Accepts]: Start accepts. Automaton has 22536 states and 25862 transitions. Word has length 29 [2019-09-09 05:49:28,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:28,563 INFO L475 AbstractCegarLoop]: Abstraction has 22536 states and 25862 transitions. [2019-09-09 05:49:28,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:28,563 INFO L276 IsEmpty]: Start isEmpty. Operand 22536 states and 25862 transitions. [2019-09-09 05:49:28,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-09 05:49:28,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:28,601 INFO L399 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, 1, 1] [2019-09-09 05:49:28,601 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:28,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:28,602 INFO L82 PathProgramCache]: Analyzing trace with hash -907508637, now seen corresponding path program 1 times [2019-09-09 05:49:28,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:28,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:28,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:28,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:28,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:28,616 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-09 05:49:28,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:28,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:28,617 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:28,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:28,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:28,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:28,617 INFO L87 Difference]: Start difference. First operand 22536 states and 25862 transitions. Second operand 3 states. [2019-09-09 05:49:28,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:28,700 INFO L93 Difference]: Finished difference Result 28166 states and 30725 transitions. [2019-09-09 05:49:28,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:28,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-09 05:49:28,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:28,701 INFO L225 Difference]: With dead ends: 28166 [2019-09-09 05:49:28,702 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:49:28,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:28,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:49:28,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:49:28,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:49:28,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:49:28,703 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-09-09 05:49:28,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:28,703 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:49:28,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:28,703 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:49:28,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:49:28,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:49:28 BoogieIcfgContainer [2019-09-09 05:49:28,709 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:49:28,712 INFO L168 Benchmark]: Toolchain (without parser) took 6218.32 ms. Allocated memory was 139.5 MB in the beginning and 483.4 MB in the end (delta: 343.9 MB). Free memory was 87.3 MB in the beginning and 307.7 MB in the end (delta: -220.5 MB). Peak memory consumption was 123.5 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:28,712 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 139.5 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-09 05:49:28,713 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.79 ms. Allocated memory is still 139.5 MB. Free memory was 87.1 MB in the beginning and 76.6 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:28,714 INFO L168 Benchmark]: Boogie Preprocessor took 133.35 ms. Allocated memory was 139.5 MB in the beginning and 199.8 MB in the end (delta: 60.3 MB). Free memory was 76.6 MB in the beginning and 176.6 MB in the end (delta: -100.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:28,715 INFO L168 Benchmark]: RCFGBuilder took 466.55 ms. Allocated memory is still 199.8 MB. Free memory was 176.6 MB in the beginning and 157.7 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:28,716 INFO L168 Benchmark]: TraceAbstraction took 5265.98 ms. Allocated memory was 199.8 MB in the beginning and 483.4 MB in the end (delta: 283.6 MB). Free memory was 157.1 MB in the beginning and 307.7 MB in the end (delta: -150.6 MB). Peak memory consumption was 133.0 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:28,719 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.30 ms. Allocated memory is still 139.5 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 345.79 ms. Allocated memory is still 139.5 MB. Free memory was 87.1 MB in the beginning and 76.6 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.35 ms. Allocated memory was 139.5 MB in the beginning and 199.8 MB in the end (delta: 60.3 MB). Free memory was 76.6 MB in the beginning and 176.6 MB in the end (delta: -100.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 466.55 ms. Allocated memory is still 199.8 MB. Free memory was 176.6 MB in the beginning and 157.7 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5265.98 ms. Allocated memory was 199.8 MB in the beginning and 483.4 MB in the end (delta: 283.6 MB). Free memory was 157.1 MB in the beginning and 307.7 MB in the end (delta: -150.6 MB). Peak memory consumption was 133.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: 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, 44 locations, 1 error locations. SAFE Result, 5.2s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2384 SDtfs, 1153 SDslu, 1624 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22536occurred in iteration=27, 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: 2.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 4124 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 659 ConstructedInterpolants, 0 QuantifiedInterpolants, 31265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...