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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_15-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:07:57,635 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:07:57,637 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:07:57,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:07:57,649 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:07:57,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:07:57,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:07:57,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:07:57,655 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:07:57,656 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:07:57,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:07:57,658 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:07:57,659 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:07:57,659 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:07:57,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:07:57,662 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:07:57,663 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:07:57,664 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:07:57,666 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:07:57,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:07:57,670 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:07:57,671 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:07:57,674 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:07:57,675 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:07:57,680 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:07:57,681 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:07:57,681 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:07:57,682 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:07:57,684 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:07:57,685 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:07:57,685 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:07:57,687 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:07:57,688 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:07:57,690 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:07:57,691 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:07:57,691 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:07:57,693 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:07:57,693 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:07:57,693 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:07:57,696 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:07:57,697 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:07:57,698 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 11:07:57,722 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:07:57,723 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:07:57,726 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:07:57,727 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:07:57,727 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:07:57,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:07:57,727 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:07:57,727 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:07:57,728 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:07:57,728 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:07:57,729 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:07:57,729 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:07:57,729 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:07:57,730 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:07:57,730 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:07:57,730 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:07:57,730 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:07:57,731 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:07:57,731 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:07:57,731 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:07:57,731 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:07:57,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:07:57,733 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:07:57,733 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:07:57,733 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:07:57,733 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:07:57,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:07:57,734 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:07:57,734 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:07:57,782 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:07:57,795 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:07:57,799 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:07:57,801 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:07:57,801 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:07:57,802 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_15-2.c [2019-10-02 11:07:57,878 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0880ae1c/dabbb30729bc4ba0b14851d4016cdbdc/FLAGa36f2a09e [2019-10-02 11:07:58,324 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:07:58,325 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15-2.c [2019-10-02 11:07:58,339 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0880ae1c/dabbb30729bc4ba0b14851d4016cdbdc/FLAGa36f2a09e [2019-10-02 11:07:58,707 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0880ae1c/dabbb30729bc4ba0b14851d4016cdbdc [2019-10-02 11:07:58,717 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:07:58,719 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:07:58,720 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:07:58,720 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:07:58,723 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:07:58,724 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:07:58" (1/1) ... [2019-10-02 11:07:58,726 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22ec9ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:07:58, skipping insertion in model container [2019-10-02 11:07:58,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:07:58" (1/1) ... [2019-10-02 11:07:58,732 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:07:58,771 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:07:58,981 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:07:58,986 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:07:59,110 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:07:59,130 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:07:59,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:07:59 WrapperNode [2019-10-02 11:07:59,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:07:59,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:07:59,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:07:59,132 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:07:59,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:07:59" (1/1) ... [2019-10-02 11:07:59,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:07:59" (1/1) ... [2019-10-02 11:07:59,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:07:59" (1/1) ... [2019-10-02 11:07:59,148 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:07:59" (1/1) ... [2019-10-02 11:07:59,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:07:59" (1/1) ... [2019-10-02 11:07:59,167 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:07:59" (1/1) ... [2019-10-02 11:07:59,169 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:07:59" (1/1) ... [2019-10-02 11:07:59,172 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:07:59,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:07:59,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:07:59,172 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:07:59,173 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:07:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:07:59,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:07:59,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:07:59,235 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:07:59,235 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:07:59,235 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:07:59,235 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:07:59,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:07:59,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:07:59,664 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:07:59,664 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 11:07:59,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:07:59 BoogieIcfgContainer [2019-10-02 11:07:59,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:07:59,667 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:07:59,667 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:07:59,670 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:07:59,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:07:58" (1/3) ... [2019-10-02 11:07:59,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f10bdf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:07:59, skipping insertion in model container [2019-10-02 11:07:59,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:07:59" (2/3) ... [2019-10-02 11:07:59,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f10bdf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:07:59, skipping insertion in model container [2019-10-02 11:07:59,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:07:59" (3/3) ... [2019-10-02 11:07:59,675 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_15-2.c [2019-10-02 11:07:59,684 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:07:59,691 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:07:59,707 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:07:59,736 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:07:59,737 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:07:59,737 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:07:59,738 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:07:59,738 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:07:59,738 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:07:59,738 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:07:59,738 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:07:59,739 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:07:59,755 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2019-10-02 11:07:59,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-02 11:07:59,763 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:07:59,764 INFO L411 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-10-02 11:07:59,767 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:07:59,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:07:59,774 INFO L82 PathProgramCache]: Analyzing trace with hash -563360106, now seen corresponding path program 1 times [2019-10-02 11:07:59,776 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:07:59,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:07:59,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:07:59,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:07:59,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:07:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:07:59,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:07:59,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:07:59,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:07:59,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:00,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:00,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:00,012 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2019-10-02 11:08:00,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:00,099 INFO L93 Difference]: Finished difference Result 117 states and 210 transitions. [2019-10-02 11:08:00,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:00,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-02 11:08:00,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:00,113 INFO L225 Difference]: With dead ends: 117 [2019-10-02 11:08:00,113 INFO L226 Difference]: Without dead ends: 102 [2019-10-02 11:08:00,117 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:00,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-02 11:08:00,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 70. [2019-10-02 11:08:00,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-02 11:08:00,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 129 transitions. [2019-10-02 11:08:00,163 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 129 transitions. Word has length 25 [2019-10-02 11:08:00,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:00,164 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 129 transitions. [2019-10-02 11:08:00,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:00,164 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 129 transitions. [2019-10-02 11:08:00,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-02 11:08:00,166 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:00,166 INFO L411 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-10-02 11:08:00,166 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:00,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:00,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1737462484, now seen corresponding path program 1 times [2019-10-02 11:08:00,167 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:00,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:00,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:00,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:00,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:00,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:00,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:00,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:00,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:00,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:00,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:00,239 INFO L87 Difference]: Start difference. First operand 70 states and 129 transitions. Second operand 3 states. [2019-10-02 11:08:00,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:00,274 INFO L93 Difference]: Finished difference Result 167 states and 312 transitions. [2019-10-02 11:08:00,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:00,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-02 11:08:00,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:00,277 INFO L225 Difference]: With dead ends: 167 [2019-10-02 11:08:00,277 INFO L226 Difference]: Without dead ends: 102 [2019-10-02 11:08:00,278 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:00,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-02 11:08:00,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-10-02 11:08:00,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-02 11:08:00,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 185 transitions. [2019-10-02 11:08:00,295 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 185 transitions. Word has length 25 [2019-10-02 11:08:00,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:00,296 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 185 transitions. [2019-10-02 11:08:00,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:00,296 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 185 transitions. [2019-10-02 11:08:00,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-02 11:08:00,297 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:00,298 INFO L411 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-10-02 11:08:00,298 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:00,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:00,299 INFO L82 PathProgramCache]: Analyzing trace with hash -284082342, now seen corresponding path program 1 times [2019-10-02 11:08:00,299 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:00,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:00,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:00,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:00,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:00,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:00,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:00,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:00,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:00,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:00,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:00,380 INFO L87 Difference]: Start difference. First operand 100 states and 185 transitions. Second operand 3 states. [2019-10-02 11:08:00,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:00,410 INFO L93 Difference]: Finished difference Result 153 states and 279 transitions. [2019-10-02 11:08:00,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:00,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-02 11:08:00,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:00,413 INFO L225 Difference]: With dead ends: 153 [2019-10-02 11:08:00,413 INFO L226 Difference]: Without dead ends: 105 [2019-10-02 11:08:00,414 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:00,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-02 11:08:00,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2019-10-02 11:08:00,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-02 11:08:00,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 187 transitions. [2019-10-02 11:08:00,427 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 187 transitions. Word has length 26 [2019-10-02 11:08:00,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:00,427 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 187 transitions. [2019-10-02 11:08:00,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:00,428 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2019-10-02 11:08:00,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-02 11:08:00,429 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:00,429 INFO L411 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-10-02 11:08:00,429 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:00,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:00,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1973026084, now seen corresponding path program 1 times [2019-10-02 11:08:00,430 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:00,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:00,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:00,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:00,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:00,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:00,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:00,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:00,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:00,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:00,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:00,516 INFO L87 Difference]: Start difference. First operand 103 states and 187 transitions. Second operand 3 states. [2019-10-02 11:08:00,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:00,546 INFO L93 Difference]: Finished difference Result 196 states and 360 transitions. [2019-10-02 11:08:00,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:00,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-02 11:08:00,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:00,549 INFO L225 Difference]: With dead ends: 196 [2019-10-02 11:08:00,549 INFO L226 Difference]: Without dead ends: 194 [2019-10-02 11:08:00,550 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:00,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-10-02 11:08:00,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 136. [2019-10-02 11:08:00,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-02 11:08:00,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 248 transitions. [2019-10-02 11:08:00,570 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 248 transitions. Word has length 26 [2019-10-02 11:08:00,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:00,571 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 248 transitions. [2019-10-02 11:08:00,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:00,571 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 248 transitions. [2019-10-02 11:08:00,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-02 11:08:00,572 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:00,573 INFO L411 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-10-02 11:08:00,573 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:00,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:00,573 INFO L82 PathProgramCache]: Analyzing trace with hash 327796506, now seen corresponding path program 1 times [2019-10-02 11:08:00,574 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:00,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:00,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:00,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:00,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:00,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:00,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:00,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:00,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:00,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:00,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:00,633 INFO L87 Difference]: Start difference. First operand 136 states and 248 transitions. Second operand 3 states. [2019-10-02 11:08:00,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:00,664 INFO L93 Difference]: Finished difference Result 324 states and 598 transitions. [2019-10-02 11:08:00,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:00,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-02 11:08:00,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:00,667 INFO L225 Difference]: With dead ends: 324 [2019-10-02 11:08:00,667 INFO L226 Difference]: Without dead ends: 196 [2019-10-02 11:08:00,669 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:00,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-10-02 11:08:00,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2019-10-02 11:08:00,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-10-02 11:08:00,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 354 transitions. [2019-10-02 11:08:00,684 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 354 transitions. Word has length 26 [2019-10-02 11:08:00,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:00,684 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 354 transitions. [2019-10-02 11:08:00,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:00,685 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 354 transitions. [2019-10-02 11:08:00,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-02 11:08:00,687 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:00,687 INFO L411 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-10-02 11:08:00,687 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:00,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:00,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1034054359, now seen corresponding path program 1 times [2019-10-02 11:08:00,688 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:00,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:00,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:00,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:00,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:00,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:00,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:00,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:00,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:00,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:00,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:00,744 INFO L87 Difference]: Start difference. First operand 194 states and 354 transitions. Second operand 3 states. [2019-10-02 11:08:00,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:00,767 INFO L93 Difference]: Finished difference Result 291 states and 529 transitions. [2019-10-02 11:08:00,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:00,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-02 11:08:00,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:00,770 INFO L225 Difference]: With dead ends: 291 [2019-10-02 11:08:00,770 INFO L226 Difference]: Without dead ends: 198 [2019-10-02 11:08:00,774 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:00,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-10-02 11:08:00,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2019-10-02 11:08:00,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-10-02 11:08:00,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 354 transitions. [2019-10-02 11:08:00,803 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 354 transitions. Word has length 27 [2019-10-02 11:08:00,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:00,804 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 354 transitions. [2019-10-02 11:08:00,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:00,804 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 354 transitions. [2019-10-02 11:08:00,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-02 11:08:00,806 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:00,806 INFO L411 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-10-02 11:08:00,806 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:00,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:00,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1571969195, now seen corresponding path program 1 times [2019-10-02 11:08:00,807 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:00,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:00,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:00,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:00,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:00,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:00,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:00,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:00,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:00,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:00,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:00,847 INFO L87 Difference]: Start difference. First operand 196 states and 354 transitions. Second operand 3 states. [2019-10-02 11:08:00,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:00,890 INFO L93 Difference]: Finished difference Result 372 states and 680 transitions. [2019-10-02 11:08:00,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:00,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-02 11:08:00,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:00,893 INFO L225 Difference]: With dead ends: 372 [2019-10-02 11:08:00,893 INFO L226 Difference]: Without dead ends: 370 [2019-10-02 11:08:00,899 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:00,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-10-02 11:08:00,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 264. [2019-10-02 11:08:00,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-10-02 11:08:00,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 474 transitions. [2019-10-02 11:08:00,916 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 474 transitions. Word has length 27 [2019-10-02 11:08:00,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:00,917 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 474 transitions. [2019-10-02 11:08:00,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:00,921 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 474 transitions. [2019-10-02 11:08:00,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-02 11:08:00,926 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:00,927 INFO L411 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-10-02 11:08:00,927 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:00,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:00,927 INFO L82 PathProgramCache]: Analyzing trace with hash -422175511, now seen corresponding path program 1 times [2019-10-02 11:08:00,927 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:00,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:00,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:00,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:00,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:00,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:00,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:00,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:00,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:00,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:00,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:00,991 INFO L87 Difference]: Start difference. First operand 264 states and 474 transitions. Second operand 3 states. [2019-10-02 11:08:01,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:01,028 INFO L93 Difference]: Finished difference Result 632 states and 1144 transitions. [2019-10-02 11:08:01,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:01,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-02 11:08:01,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:01,032 INFO L225 Difference]: With dead ends: 632 [2019-10-02 11:08:01,032 INFO L226 Difference]: Without dead ends: 378 [2019-10-02 11:08:01,036 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:01,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-10-02 11:08:01,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 376. [2019-10-02 11:08:01,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-10-02 11:08:01,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 674 transitions. [2019-10-02 11:08:01,058 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 674 transitions. Word has length 27 [2019-10-02 11:08:01,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:01,058 INFO L475 AbstractCegarLoop]: Abstraction has 376 states and 674 transitions. [2019-10-02 11:08:01,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:01,058 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 674 transitions. [2019-10-02 11:08:01,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-02 11:08:01,064 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:01,064 INFO L411 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-10-02 11:08:01,065 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:01,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:01,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1486617231, now seen corresponding path program 1 times [2019-10-02 11:08:01,065 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:01,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:01,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:01,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:01,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:01,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:01,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:01,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:01,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:01,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:01,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:01,112 INFO L87 Difference]: Start difference. First operand 376 states and 674 transitions. Second operand 3 states. [2019-10-02 11:08:01,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:01,134 INFO L93 Difference]: Finished difference Result 564 states and 1008 transitions. [2019-10-02 11:08:01,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:01,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-02 11:08:01,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:01,138 INFO L225 Difference]: With dead ends: 564 [2019-10-02 11:08:01,138 INFO L226 Difference]: Without dead ends: 382 [2019-10-02 11:08:01,140 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:01,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-10-02 11:08:01,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 380. [2019-10-02 11:08:01,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-10-02 11:08:01,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 674 transitions. [2019-10-02 11:08:01,155 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 674 transitions. Word has length 28 [2019-10-02 11:08:01,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:01,156 INFO L475 AbstractCegarLoop]: Abstraction has 380 states and 674 transitions. [2019-10-02 11:08:01,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:01,156 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 674 transitions. [2019-10-02 11:08:01,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-02 11:08:01,157 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:01,157 INFO L411 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-10-02 11:08:01,158 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:01,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:01,158 INFO L82 PathProgramCache]: Analyzing trace with hash -202326511, now seen corresponding path program 1 times [2019-10-02 11:08:01,158 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:01,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:01,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:01,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:01,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:01,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:01,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:01,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:01,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:01,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:01,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:01,208 INFO L87 Difference]: Start difference. First operand 380 states and 674 transitions. Second operand 3 states. [2019-10-02 11:08:01,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:01,238 INFO L93 Difference]: Finished difference Result 716 states and 1288 transitions. [2019-10-02 11:08:01,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:01,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-02 11:08:01,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:01,245 INFO L225 Difference]: With dead ends: 716 [2019-10-02 11:08:01,245 INFO L226 Difference]: Without dead ends: 714 [2019-10-02 11:08:01,246 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:01,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-10-02 11:08:01,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 520. [2019-10-02 11:08:01,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-10-02 11:08:01,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 910 transitions. [2019-10-02 11:08:01,266 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 910 transitions. Word has length 28 [2019-10-02 11:08:01,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:01,267 INFO L475 AbstractCegarLoop]: Abstraction has 520 states and 910 transitions. [2019-10-02 11:08:01,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:01,267 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 910 transitions. [2019-10-02 11:08:01,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-02 11:08:01,269 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:01,269 INFO L411 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-10-02 11:08:01,269 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:01,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:01,270 INFO L82 PathProgramCache]: Analyzing trace with hash 2098496079, now seen corresponding path program 1 times [2019-10-02 11:08:01,270 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:01,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:01,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:01,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:01,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:01,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:01,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:01,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:01,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:01,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:01,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:01,315 INFO L87 Difference]: Start difference. First operand 520 states and 910 transitions. Second operand 3 states. [2019-10-02 11:08:01,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:01,344 INFO L93 Difference]: Finished difference Result 1244 states and 2192 transitions. [2019-10-02 11:08:01,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:01,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-02 11:08:01,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:01,348 INFO L225 Difference]: With dead ends: 1244 [2019-10-02 11:08:01,349 INFO L226 Difference]: Without dead ends: 738 [2019-10-02 11:08:01,350 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:01,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-10-02 11:08:01,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 736. [2019-10-02 11:08:01,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-10-02 11:08:01,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1286 transitions. [2019-10-02 11:08:01,372 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1286 transitions. Word has length 28 [2019-10-02 11:08:01,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:01,372 INFO L475 AbstractCegarLoop]: Abstraction has 736 states and 1286 transitions. [2019-10-02 11:08:01,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:01,372 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1286 transitions. [2019-10-02 11:08:01,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-02 11:08:01,374 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:01,374 INFO L411 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-10-02 11:08:01,374 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:01,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:01,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1976941762, now seen corresponding path program 1 times [2019-10-02 11:08:01,375 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:01,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:01,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:01,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:01,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:01,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:01,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:01,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:01,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:01,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:01,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:01,403 INFO L87 Difference]: Start difference. First operand 736 states and 1286 transitions. Second operand 3 states. [2019-10-02 11:08:01,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:01,434 INFO L93 Difference]: Finished difference Result 1104 states and 1924 transitions. [2019-10-02 11:08:01,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:01,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-02 11:08:01,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:01,439 INFO L225 Difference]: With dead ends: 1104 [2019-10-02 11:08:01,440 INFO L226 Difference]: Without dead ends: 746 [2019-10-02 11:08:01,441 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:01,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2019-10-02 11:08:01,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 744. [2019-10-02 11:08:01,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2019-10-02 11:08:01,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1286 transitions. [2019-10-02 11:08:01,462 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1286 transitions. Word has length 29 [2019-10-02 11:08:01,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:01,463 INFO L475 AbstractCegarLoop]: Abstraction has 744 states and 1286 transitions. [2019-10-02 11:08:01,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:01,463 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1286 transitions. [2019-10-02 11:08:01,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-02 11:08:01,464 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:01,464 INFO L411 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-10-02 11:08:01,465 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:01,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:01,465 INFO L82 PathProgramCache]: Analyzing trace with hash 629081792, now seen corresponding path program 1 times [2019-10-02 11:08:01,465 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:01,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:01,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:01,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:01,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:01,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:01,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:01,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:01,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:01,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:01,489 INFO L87 Difference]: Start difference. First operand 744 states and 1286 transitions. Second operand 3 states. [2019-10-02 11:08:01,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:01,515 INFO L93 Difference]: Finished difference Result 1388 states and 2440 transitions. [2019-10-02 11:08:01,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:01,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-02 11:08:01,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:01,523 INFO L225 Difference]: With dead ends: 1388 [2019-10-02 11:08:01,523 INFO L226 Difference]: Without dead ends: 1386 [2019-10-02 11:08:01,524 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:01,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2019-10-02 11:08:01,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1032. [2019-10-02 11:08:01,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2019-10-02 11:08:01,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1750 transitions. [2019-10-02 11:08:01,557 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1750 transitions. Word has length 29 [2019-10-02 11:08:01,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:01,558 INFO L475 AbstractCegarLoop]: Abstraction has 1032 states and 1750 transitions. [2019-10-02 11:08:01,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:01,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1750 transitions. [2019-10-02 11:08:01,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-02 11:08:01,560 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:01,560 INFO L411 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-10-02 11:08:01,561 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:01,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:01,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1365062914, now seen corresponding path program 1 times [2019-10-02 11:08:01,561 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:01,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:01,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:01,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:01,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:01,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:01,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:01,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:01,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:01,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:01,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:01,588 INFO L87 Difference]: Start difference. First operand 1032 states and 1750 transitions. Second operand 3 states. [2019-10-02 11:08:01,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:01,622 INFO L93 Difference]: Finished difference Result 2460 states and 4200 transitions. [2019-10-02 11:08:01,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:01,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-02 11:08:01,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:01,631 INFO L225 Difference]: With dead ends: 2460 [2019-10-02 11:08:01,631 INFO L226 Difference]: Without dead ends: 1450 [2019-10-02 11:08:01,634 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:01,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2019-10-02 11:08:01,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1448. [2019-10-02 11:08:01,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1448 states. [2019-10-02 11:08:01,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 2454 transitions. [2019-10-02 11:08:01,686 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 2454 transitions. Word has length 29 [2019-10-02 11:08:01,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:01,686 INFO L475 AbstractCegarLoop]: Abstraction has 1448 states and 2454 transitions. [2019-10-02 11:08:01,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:01,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 2454 transitions. [2019-10-02 11:08:01,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-02 11:08:01,689 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:01,689 INFO L411 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, 1] [2019-10-02 11:08:01,690 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:01,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:01,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1973087804, now seen corresponding path program 1 times [2019-10-02 11:08:01,690 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:01,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:01,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:01,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:01,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:01,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:01,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:01,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:01,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:01,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:01,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:01,725 INFO L87 Difference]: Start difference. First operand 1448 states and 2454 transitions. Second operand 3 states. [2019-10-02 11:08:01,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:01,761 INFO L93 Difference]: Finished difference Result 2172 states and 3672 transitions. [2019-10-02 11:08:01,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:01,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-02 11:08:01,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:01,773 INFO L225 Difference]: With dead ends: 2172 [2019-10-02 11:08:01,773 INFO L226 Difference]: Without dead ends: 1466 [2019-10-02 11:08:01,777 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:01,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2019-10-02 11:08:01,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1464. [2019-10-02 11:08:01,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1464 states. [2019-10-02 11:08:01,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2454 transitions. [2019-10-02 11:08:01,826 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2454 transitions. Word has length 30 [2019-10-02 11:08:01,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:01,827 INFO L475 AbstractCegarLoop]: Abstraction has 1464 states and 2454 transitions. [2019-10-02 11:08:01,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:01,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2454 transitions. [2019-10-02 11:08:01,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-02 11:08:01,830 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:01,830 INFO L411 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, 1] [2019-10-02 11:08:01,830 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:01,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:01,831 INFO L82 PathProgramCache]: Analyzing trace with hash 632935750, now seen corresponding path program 1 times [2019-10-02 11:08:01,831 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:01,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:01,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:01,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:01,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:01,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:01,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:01,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:01,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:01,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:01,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:01,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:01,868 INFO L87 Difference]: Start difference. First operand 1464 states and 2454 transitions. Second operand 3 states. [2019-10-02 11:08:01,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:01,924 INFO L93 Difference]: Finished difference Result 2700 states and 4616 transitions. [2019-10-02 11:08:01,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:01,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-02 11:08:01,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:01,937 INFO L225 Difference]: With dead ends: 2700 [2019-10-02 11:08:01,937 INFO L226 Difference]: Without dead ends: 2698 [2019-10-02 11:08:01,939 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:01,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2019-10-02 11:08:01,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2056. [2019-10-02 11:08:01,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2019-10-02 11:08:02,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 3366 transitions. [2019-10-02 11:08:02,006 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 3366 transitions. Word has length 30 [2019-10-02 11:08:02,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:02,006 INFO L475 AbstractCegarLoop]: Abstraction has 2056 states and 3366 transitions. [2019-10-02 11:08:02,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:02,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 3366 transitions. [2019-10-02 11:08:02,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-02 11:08:02,010 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:02,010 INFO L411 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, 1] [2019-10-02 11:08:02,010 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:02,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:02,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1361208956, now seen corresponding path program 1 times [2019-10-02 11:08:02,011 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:02,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:02,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:02,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:02,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:02,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:02,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:02,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:02,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:02,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:02,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:02,046 INFO L87 Difference]: Start difference. First operand 2056 states and 3366 transitions. Second operand 3 states. [2019-10-02 11:08:02,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:02,103 INFO L93 Difference]: Finished difference Result 4876 states and 8040 transitions. [2019-10-02 11:08:02,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:02,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-02 11:08:02,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:02,119 INFO L225 Difference]: With dead ends: 4876 [2019-10-02 11:08:02,119 INFO L226 Difference]: Without dead ends: 2858 [2019-10-02 11:08:02,124 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:02,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2019-10-02 11:08:02,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2856. [2019-10-02 11:08:02,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2856 states. [2019-10-02 11:08:02,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 4678 transitions. [2019-10-02 11:08:02,208 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 4678 transitions. Word has length 30 [2019-10-02 11:08:02,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:02,208 INFO L475 AbstractCegarLoop]: Abstraction has 2856 states and 4678 transitions. [2019-10-02 11:08:02,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:02,208 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 4678 transitions. [2019-10-02 11:08:02,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-02 11:08:02,212 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:02,212 INFO L411 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, 1, 1] [2019-10-02 11:08:02,212 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:02,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:02,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1853614765, now seen corresponding path program 1 times [2019-10-02 11:08:02,213 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:02,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:02,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:02,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:02,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:02,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:02,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:02,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:02,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:02,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:02,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:02,240 INFO L87 Difference]: Start difference. First operand 2856 states and 4678 transitions. Second operand 3 states. [2019-10-02 11:08:02,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:02,286 INFO L93 Difference]: Finished difference Result 4284 states and 7000 transitions. [2019-10-02 11:08:02,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:02,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-02 11:08:02,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:02,303 INFO L225 Difference]: With dead ends: 4284 [2019-10-02 11:08:02,303 INFO L226 Difference]: Without dead ends: 2890 [2019-10-02 11:08:02,307 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:02,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2019-10-02 11:08:02,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 2888. [2019-10-02 11:08:02,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2888 states. [2019-10-02 11:08:02,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 4678 transitions. [2019-10-02 11:08:02,415 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 4678 transitions. Word has length 31 [2019-10-02 11:08:02,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:02,416 INFO L475 AbstractCegarLoop]: Abstraction has 2888 states and 4678 transitions. [2019-10-02 11:08:02,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:02,416 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 4678 transitions. [2019-10-02 11:08:02,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-02 11:08:02,420 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:02,420 INFO L411 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, 1, 1] [2019-10-02 11:08:02,420 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:02,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:02,420 INFO L82 PathProgramCache]: Analyzing trace with hash 752408789, now seen corresponding path program 1 times [2019-10-02 11:08:02,420 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:02,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:02,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:02,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:02,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:02,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:02,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:02,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:02,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:02,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:02,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:02,442 INFO L87 Difference]: Start difference. First operand 2888 states and 4678 transitions. Second operand 3 states. [2019-10-02 11:08:02,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:02,500 INFO L93 Difference]: Finished difference Result 5260 states and 8712 transitions. [2019-10-02 11:08:02,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:02,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-02 11:08:02,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:02,527 INFO L225 Difference]: With dead ends: 5260 [2019-10-02 11:08:02,527 INFO L226 Difference]: Without dead ends: 5258 [2019-10-02 11:08:02,530 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:02,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2019-10-02 11:08:02,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 4104. [2019-10-02 11:08:02,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2019-10-02 11:08:02,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 6470 transitions. [2019-10-02 11:08:02,652 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 6470 transitions. Word has length 31 [2019-10-02 11:08:02,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:02,652 INFO L475 AbstractCegarLoop]: Abstraction has 4104 states and 6470 transitions. [2019-10-02 11:08:02,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:02,653 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 6470 transitions. [2019-10-02 11:08:02,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-02 11:08:02,663 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:02,663 INFO L411 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, 1, 1] [2019-10-02 11:08:02,663 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:02,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:02,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1241735917, now seen corresponding path program 1 times [2019-10-02 11:08:02,663 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:02,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:02,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:02,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:02,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:02,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:02,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:02,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:02,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:02,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:02,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:02,691 INFO L87 Difference]: Start difference. First operand 4104 states and 6470 transitions. Second operand 3 states. [2019-10-02 11:08:02,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:02,779 INFO L93 Difference]: Finished difference Result 9676 states and 15368 transitions. [2019-10-02 11:08:02,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:02,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-02 11:08:02,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:02,821 INFO L225 Difference]: With dead ends: 9676 [2019-10-02 11:08:02,821 INFO L226 Difference]: Without dead ends: 5642 [2019-10-02 11:08:02,829 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:02,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2019-10-02 11:08:02,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 5640. [2019-10-02 11:08:02,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5640 states. [2019-10-02 11:08:03,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5640 states to 5640 states and 8902 transitions. [2019-10-02 11:08:03,013 INFO L78 Accepts]: Start accepts. Automaton has 5640 states and 8902 transitions. Word has length 31 [2019-10-02 11:08:03,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:03,014 INFO L475 AbstractCegarLoop]: Abstraction has 5640 states and 8902 transitions. [2019-10-02 11:08:03,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:03,014 INFO L276 IsEmpty]: Start isEmpty. Operand 5640 states and 8902 transitions. [2019-10-02 11:08:03,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 11:08:03,022 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:03,022 INFO L411 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, 1, 1, 1] [2019-10-02 11:08:03,022 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:03,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:03,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1850049785, now seen corresponding path program 1 times [2019-10-02 11:08:03,023 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:03,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:03,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:03,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:03,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:03,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:03,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:03,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:03,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:03,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:03,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:03,056 INFO L87 Difference]: Start difference. First operand 5640 states and 8902 transitions. Second operand 3 states. [2019-10-02 11:08:03,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:03,141 INFO L93 Difference]: Finished difference Result 8460 states and 13320 transitions. [2019-10-02 11:08:03,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:03,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-02 11:08:03,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:03,158 INFO L225 Difference]: With dead ends: 8460 [2019-10-02 11:08:03,159 INFO L226 Difference]: Without dead ends: 5706 [2019-10-02 11:08:03,166 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:03,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5706 states. [2019-10-02 11:08:03,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5706 to 5704. [2019-10-02 11:08:03,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5704 states. [2019-10-02 11:08:03,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5704 states to 5704 states and 8902 transitions. [2019-10-02 11:08:03,294 INFO L78 Accepts]: Start accepts. Automaton has 5704 states and 8902 transitions. Word has length 32 [2019-10-02 11:08:03,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:03,294 INFO L475 AbstractCegarLoop]: Abstraction has 5704 states and 8902 transitions. [2019-10-02 11:08:03,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:03,294 INFO L276 IsEmpty]: Start isEmpty. Operand 5704 states and 8902 transitions. [2019-10-02 11:08:03,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 11:08:03,301 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:03,302 INFO L411 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, 1, 1, 1] [2019-10-02 11:08:03,302 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:03,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:03,302 INFO L82 PathProgramCache]: Analyzing trace with hash 161106043, now seen corresponding path program 1 times [2019-10-02 11:08:03,302 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:03,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:03,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:03,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:03,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:03,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:03,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:03,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:03,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:03,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:03,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:03,334 INFO L87 Difference]: Start difference. First operand 5704 states and 8902 transitions. Second operand 3 states. [2019-10-02 11:08:03,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:03,468 INFO L93 Difference]: Finished difference Result 16716 states and 25928 transitions. [2019-10-02 11:08:03,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:03,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-02 11:08:03,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:03,506 INFO L225 Difference]: With dead ends: 16716 [2019-10-02 11:08:03,506 INFO L226 Difference]: Without dead ends: 11146 [2019-10-02 11:08:03,527 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:03,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11146 states. [2019-10-02 11:08:03,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11146 to 11144. [2019-10-02 11:08:03,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2019-10-02 11:08:04,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 17030 transitions. [2019-10-02 11:08:04,031 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 17030 transitions. Word has length 32 [2019-10-02 11:08:04,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:04,031 INFO L475 AbstractCegarLoop]: Abstraction has 11144 states and 17030 transitions. [2019-10-02 11:08:04,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:04,032 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 17030 transitions. [2019-10-02 11:08:04,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 11:08:04,046 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:04,046 INFO L411 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, 1, 1, 1] [2019-10-02 11:08:04,046 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:04,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:04,047 INFO L82 PathProgramCache]: Analyzing trace with hash -2139716547, now seen corresponding path program 1 times [2019-10-02 11:08:04,047 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:04,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:04,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:04,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:04,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:04,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:04,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:04,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:04,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:04,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:04,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:04,079 INFO L87 Difference]: Start difference. First operand 11144 states and 17030 transitions. Second operand 3 states. [2019-10-02 11:08:04,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:04,248 INFO L93 Difference]: Finished difference Result 13196 states and 20872 transitions. [2019-10-02 11:08:04,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:04,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-02 11:08:04,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:04,279 INFO L225 Difference]: With dead ends: 13196 [2019-10-02 11:08:04,280 INFO L226 Difference]: Without dead ends: 13194 [2019-10-02 11:08:04,285 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:04,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13194 states. [2019-10-02 11:08:04,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13194 to 11144. [2019-10-02 11:08:04,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2019-10-02 11:08:04,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 16902 transitions. [2019-10-02 11:08:04,975 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 16902 transitions. Word has length 32 [2019-10-02 11:08:04,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:04,975 INFO L475 AbstractCegarLoop]: Abstraction has 11144 states and 16902 transitions. [2019-10-02 11:08:04,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:04,976 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 16902 transitions. [2019-10-02 11:08:04,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-02 11:08:04,988 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:04,988 INFO L411 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, 1, 1, 1, 1] [2019-10-02 11:08:04,989 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:04,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:04,989 INFO L82 PathProgramCache]: Analyzing trace with hash 699534184, now seen corresponding path program 1 times [2019-10-02 11:08:04,989 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:04,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:04,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:04,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:04,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:05,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:05,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:05,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:05,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:05,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:05,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:05,010 INFO L87 Difference]: Start difference. First operand 11144 states and 16902 transitions. Second operand 3 states. [2019-10-02 11:08:05,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:05,184 INFO L93 Difference]: Finished difference Result 19852 states and 30856 transitions. [2019-10-02 11:08:05,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:05,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-02 11:08:05,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:05,232 INFO L225 Difference]: With dead ends: 19852 [2019-10-02 11:08:05,232 INFO L226 Difference]: Without dead ends: 19850 [2019-10-02 11:08:05,242 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:05,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19850 states. [2019-10-02 11:08:05,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19850 to 16264. [2019-10-02 11:08:05,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16264 states. [2019-10-02 11:08:05,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16264 states to 16264 states and 23942 transitions. [2019-10-02 11:08:05,614 INFO L78 Accepts]: Start accepts. Automaton has 16264 states and 23942 transitions. Word has length 33 [2019-10-02 11:08:05,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:05,615 INFO L475 AbstractCegarLoop]: Abstraction has 16264 states and 23942 transitions. [2019-10-02 11:08:05,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:05,615 INFO L276 IsEmpty]: Start isEmpty. Operand 16264 states and 23942 transitions. [2019-10-02 11:08:05,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-02 11:08:05,641 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:05,642 INFO L411 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, 1, 1, 1, 1] [2019-10-02 11:08:05,642 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:05,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:05,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1294610522, now seen corresponding path program 1 times [2019-10-02 11:08:05,643 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:05,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:05,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:05,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:05,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:05,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:05,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:05,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:05,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:05,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:05,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:05,732 INFO L87 Difference]: Start difference. First operand 16264 states and 23942 transitions. Second operand 3 states. [2019-10-02 11:08:05,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:05,940 INFO L93 Difference]: Finished difference Result 38028 states and 56456 transitions. [2019-10-02 11:08:05,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:05,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-02 11:08:05,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:05,982 INFO L225 Difference]: With dead ends: 38028 [2019-10-02 11:08:05,983 INFO L226 Difference]: Without dead ends: 21898 [2019-10-02 11:08:06,014 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:06,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21898 states. [2019-10-02 11:08:06,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21898 to 21896. [2019-10-02 11:08:06,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21896 states. [2019-10-02 11:08:06,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21896 states to 21896 states and 32262 transitions. [2019-10-02 11:08:06,534 INFO L78 Accepts]: Start accepts. Automaton has 21896 states and 32262 transitions. Word has length 33 [2019-10-02 11:08:06,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:06,534 INFO L475 AbstractCegarLoop]: Abstraction has 21896 states and 32262 transitions. [2019-10-02 11:08:06,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:06,534 INFO L276 IsEmpty]: Start isEmpty. Operand 21896 states and 32262 transitions. [2019-10-02 11:08:06,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-02 11:08:06,558 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:06,558 INFO L411 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, 1, 1, 1, 1, 1] [2019-10-02 11:08:06,559 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:06,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:06,560 INFO L82 PathProgramCache]: Analyzing trace with hash 210937712, now seen corresponding path program 1 times [2019-10-02 11:08:06,560 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:06,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:06,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:06,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:06,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:06,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:06,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:06,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:06,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:06,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:06,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:06,585 INFO L87 Difference]: Start difference. First operand 21896 states and 32262 transitions. Second operand 3 states. [2019-10-02 11:08:06,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:06,774 INFO L93 Difference]: Finished difference Result 33036 states and 48648 transitions. [2019-10-02 11:08:06,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:06,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-02 11:08:06,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:06,816 INFO L225 Difference]: With dead ends: 33036 [2019-10-02 11:08:06,816 INFO L226 Difference]: Without dead ends: 22282 [2019-10-02 11:08:06,841 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:06,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22282 states. [2019-10-02 11:08:07,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22282 to 22280. [2019-10-02 11:08:07,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22280 states. [2019-10-02 11:08:08,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22280 states to 22280 states and 32518 transitions. [2019-10-02 11:08:08,052 INFO L78 Accepts]: Start accepts. Automaton has 22280 states and 32518 transitions. Word has length 34 [2019-10-02 11:08:08,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:08,052 INFO L475 AbstractCegarLoop]: Abstraction has 22280 states and 32518 transitions. [2019-10-02 11:08:08,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:08,052 INFO L276 IsEmpty]: Start isEmpty. Operand 22280 states and 32518 transitions. [2019-10-02 11:08:08,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-02 11:08:08,076 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:08,076 INFO L411 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, 1, 1, 1, 1, 1] [2019-10-02 11:08:08,076 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:08,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:08,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1478006030, now seen corresponding path program 1 times [2019-10-02 11:08:08,077 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:08,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:08,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:08,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:08,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:08,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:08,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:08,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:08,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:08,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:08,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:08,101 INFO L87 Difference]: Start difference. First operand 22280 states and 32518 transitions. Second operand 3 states. [2019-10-02 11:08:08,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:08,442 INFO L93 Difference]: Finished difference Result 38924 states and 58120 transitions. [2019-10-02 11:08:08,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:08,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-02 11:08:08,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:08,536 INFO L225 Difference]: With dead ends: 38924 [2019-10-02 11:08:08,537 INFO L226 Difference]: Without dead ends: 38922 [2019-10-02 11:08:08,550 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:08,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38922 states. [2019-10-02 11:08:09,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38922 to 32776. [2019-10-02 11:08:09,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32776 states. [2019-10-02 11:08:09,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32776 states to 32776 states and 46342 transitions. [2019-10-02 11:08:09,217 INFO L78 Accepts]: Start accepts. Automaton has 32776 states and 46342 transitions. Word has length 34 [2019-10-02 11:08:09,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:09,217 INFO L475 AbstractCegarLoop]: Abstraction has 32776 states and 46342 transitions. [2019-10-02 11:08:09,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:09,217 INFO L276 IsEmpty]: Start isEmpty. Operand 32776 states and 46342 transitions. [2019-10-02 11:08:09,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-02 11:08:09,257 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:09,257 INFO L411 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, 1, 1, 1, 1, 1] [2019-10-02 11:08:09,257 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:09,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:09,258 INFO L82 PathProgramCache]: Analyzing trace with hash 822816560, now seen corresponding path program 1 times [2019-10-02 11:08:09,258 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:09,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:09,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:09,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:09,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:09,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:09,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:09,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:09,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:09,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:09,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:09,280 INFO L87 Difference]: Start difference. First operand 32776 states and 46342 transitions. Second operand 3 states. [2019-10-02 11:08:09,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:09,667 INFO L93 Difference]: Finished difference Result 75788 states and 107784 transitions. [2019-10-02 11:08:09,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:09,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-02 11:08:09,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:09,731 INFO L225 Difference]: With dead ends: 75788 [2019-10-02 11:08:09,731 INFO L226 Difference]: Without dead ends: 43530 [2019-10-02 11:08:09,786 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:09,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43530 states. [2019-10-02 11:08:10,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43530 to 43528. [2019-10-02 11:08:10,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43528 states. [2019-10-02 11:08:10,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43528 states to 43528 states and 61446 transitions. [2019-10-02 11:08:10,687 INFO L78 Accepts]: Start accepts. Automaton has 43528 states and 61446 transitions. Word has length 34 [2019-10-02 11:08:10,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:10,687 INFO L475 AbstractCegarLoop]: Abstraction has 43528 states and 61446 transitions. [2019-10-02 11:08:10,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:10,688 INFO L276 IsEmpty]: Start isEmpty. Operand 43528 states and 61446 transitions. [2019-10-02 11:08:10,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-02 11:08:10,713 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:10,713 INFO L411 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, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:10,713 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:10,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:10,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1426668155, now seen corresponding path program 1 times [2019-10-02 11:08:10,714 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:10,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:10,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:10,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:10,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:10,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:10,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:10,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:10,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:10,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:10,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:10,749 INFO L87 Difference]: Start difference. First operand 43528 states and 61446 transitions. Second operand 3 states. [2019-10-02 11:08:11,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:11,087 INFO L93 Difference]: Finished difference Result 65292 states and 91912 transitions. [2019-10-02 11:08:11,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:11,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-02 11:08:11,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:11,397 INFO L225 Difference]: With dead ends: 65292 [2019-10-02 11:08:11,397 INFO L226 Difference]: Without dead ends: 44042 [2019-10-02 11:08:11,416 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:11,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44042 states. [2019-10-02 11:08:11,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44042 to 44040. [2019-10-02 11:08:11,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44040 states. [2019-10-02 11:08:11,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44040 states to 44040 states and 61446 transitions. [2019-10-02 11:08:11,973 INFO L78 Accepts]: Start accepts. Automaton has 44040 states and 61446 transitions. Word has length 35 [2019-10-02 11:08:11,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:11,973 INFO L475 AbstractCegarLoop]: Abstraction has 44040 states and 61446 transitions. [2019-10-02 11:08:11,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:11,974 INFO L276 IsEmpty]: Start isEmpty. Operand 44040 states and 61446 transitions. [2019-10-02 11:08:11,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-02 11:08:11,996 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:11,996 INFO L411 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, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:11,997 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:11,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:11,997 INFO L82 PathProgramCache]: Analyzing trace with hash -262275587, now seen corresponding path program 1 times [2019-10-02 11:08:11,997 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:11,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:11,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:11,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:11,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:12,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:12,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:12,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:12,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:12,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:12,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:12,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:12,028 INFO L87 Difference]: Start difference. First operand 44040 states and 61446 transitions. Second operand 3 states. [2019-10-02 11:08:12,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:12,657 INFO L93 Difference]: Finished difference Result 75788 states and 108040 transitions. [2019-10-02 11:08:12,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:12,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-02 11:08:12,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:12,718 INFO L225 Difference]: With dead ends: 75788 [2019-10-02 11:08:12,718 INFO L226 Difference]: Without dead ends: 75786 [2019-10-02 11:08:12,726 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:12,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75786 states. [2019-10-02 11:08:13,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75786 to 65544. [2019-10-02 11:08:13,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65544 states. [2019-10-02 11:08:14,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65544 states to 65544 states and 88582 transitions. [2019-10-02 11:08:14,904 INFO L78 Accepts]: Start accepts. Automaton has 65544 states and 88582 transitions. Word has length 35 [2019-10-02 11:08:14,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:14,905 INFO L475 AbstractCegarLoop]: Abstraction has 65544 states and 88582 transitions. [2019-10-02 11:08:14,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:14,905 INFO L276 IsEmpty]: Start isEmpty. Operand 65544 states and 88582 transitions. [2019-10-02 11:08:14,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-02 11:08:14,946 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:14,946 INFO L411 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, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:14,947 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:14,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:14,947 INFO L82 PathProgramCache]: Analyzing trace with hash 2038547003, now seen corresponding path program 1 times [2019-10-02 11:08:14,947 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:14,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:14,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:14,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:14,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:14,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:14,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:14,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:14,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:14,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:14,965 INFO L87 Difference]: Start difference. First operand 65544 states and 88582 transitions. Second operand 3 states. [2019-10-02 11:08:15,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:15,562 INFO L93 Difference]: Finished difference Result 150540 states and 204296 transitions. [2019-10-02 11:08:15,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:15,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-02 11:08:15,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:15,640 INFO L225 Difference]: With dead ends: 150540 [2019-10-02 11:08:15,640 INFO L226 Difference]: Without dead ends: 86026 [2019-10-02 11:08:15,698 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:15,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86026 states. [2019-10-02 11:08:16,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86026 to 86024. [2019-10-02 11:08:16,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86024 states. [2019-10-02 11:08:16,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86024 states to 86024 states and 115718 transitions. [2019-10-02 11:08:16,860 INFO L78 Accepts]: Start accepts. Automaton has 86024 states and 115718 transitions. Word has length 35 [2019-10-02 11:08:16,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:16,860 INFO L475 AbstractCegarLoop]: Abstraction has 86024 states and 115718 transitions. [2019-10-02 11:08:16,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:16,861 INFO L276 IsEmpty]: Start isEmpty. Operand 86024 states and 115718 transitions. [2019-10-02 11:08:16,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-02 11:08:16,892 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:16,892 INFO L411 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:16,892 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:16,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:16,893 INFO L82 PathProgramCache]: Analyzing trace with hash 459606565, now seen corresponding path program 1 times [2019-10-02 11:08:16,893 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:16,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:16,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:16,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:16,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:16,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:16,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:16,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:16,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:16,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:16,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:16,910 INFO L87 Difference]: Start difference. First operand 86024 states and 115718 transitions. Second operand 3 states. [2019-10-02 11:08:17,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:17,724 INFO L93 Difference]: Finished difference Result 129036 states and 173064 transitions. [2019-10-02 11:08:17,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:17,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-02 11:08:17,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:17,795 INFO L225 Difference]: With dead ends: 129036 [2019-10-02 11:08:17,796 INFO L226 Difference]: Without dead ends: 87050 [2019-10-02 11:08:17,821 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:17,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87050 states. [2019-10-02 11:08:18,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87050 to 87048. [2019-10-02 11:08:18,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87048 states. [2019-10-02 11:08:21,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87048 states to 87048 states and 115718 transitions. [2019-10-02 11:08:21,096 INFO L78 Accepts]: Start accepts. Automaton has 87048 states and 115718 transitions. Word has length 36 [2019-10-02 11:08:21,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:21,097 INFO L475 AbstractCegarLoop]: Abstraction has 87048 states and 115718 transitions. [2019-10-02 11:08:21,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:21,097 INFO L276 IsEmpty]: Start isEmpty. Operand 87048 states and 115718 transitions. [2019-10-02 11:08:21,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-02 11:08:21,132 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:21,132 INFO L411 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:21,132 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:21,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:21,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1229337177, now seen corresponding path program 1 times [2019-10-02 11:08:21,133 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:21,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:21,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:21,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:21,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:21,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:21,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:21,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:21,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:21,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:21,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:21,156 INFO L87 Difference]: Start difference. First operand 87048 states and 115718 transitions. Second operand 3 states. [2019-10-02 11:08:22,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:22,087 INFO L93 Difference]: Finished difference Result 147468 states and 199688 transitions. [2019-10-02 11:08:22,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:22,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-02 11:08:22,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:22,227 INFO L225 Difference]: With dead ends: 147468 [2019-10-02 11:08:22,228 INFO L226 Difference]: Without dead ends: 147466 [2019-10-02 11:08:22,262 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:22,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147466 states. [2019-10-02 11:08:23,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147466 to 131080. [2019-10-02 11:08:23,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131080 states. [2019-10-02 11:08:23,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131080 states to 131080 states and 168966 transitions. [2019-10-02 11:08:23,773 INFO L78 Accepts]: Start accepts. Automaton has 131080 states and 168966 transitions. Word has length 36 [2019-10-02 11:08:23,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:23,773 INFO L475 AbstractCegarLoop]: Abstraction has 131080 states and 168966 transitions. [2019-10-02 11:08:23,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:23,774 INFO L276 IsEmpty]: Start isEmpty. Operand 131080 states and 168966 transitions. [2019-10-02 11:08:23,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-02 11:08:23,840 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:23,840 INFO L411 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:23,841 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:23,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:23,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1071485413, now seen corresponding path program 1 times [2019-10-02 11:08:23,841 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:23,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:23,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:23,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:23,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:23,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:23,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:23,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:23,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:23,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:23,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:23,859 INFO L87 Difference]: Start difference. First operand 131080 states and 168966 transitions. Second operand 3 states. [2019-10-02 11:08:25,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:25,468 INFO L93 Difference]: Finished difference Result 299020 states and 386056 transitions. [2019-10-02 11:08:25,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:25,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-02 11:08:25,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:25,688 INFO L225 Difference]: With dead ends: 299020 [2019-10-02 11:08:25,688 INFO L226 Difference]: Without dead ends: 169994 [2019-10-02 11:08:25,808 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:25,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169994 states. [2019-10-02 11:08:30,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169994 to 169992. [2019-10-02 11:08:30,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169992 states. [2019-10-02 11:08:30,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169992 states to 169992 states and 217094 transitions. [2019-10-02 11:08:30,858 INFO L78 Accepts]: Start accepts. Automaton has 169992 states and 217094 transitions. Word has length 36 [2019-10-02 11:08:30,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:30,859 INFO L475 AbstractCegarLoop]: Abstraction has 169992 states and 217094 transitions. [2019-10-02 11:08:30,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:30,859 INFO L276 IsEmpty]: Start isEmpty. Operand 169992 states and 217094 transitions. [2019-10-02 11:08:30,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-02 11:08:30,925 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:30,925 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:30,925 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:30,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:30,925 INFO L82 PathProgramCache]: Analyzing trace with hash 545468688, now seen corresponding path program 1 times [2019-10-02 11:08:30,925 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:30,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:30,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:30,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:30,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:30,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:30,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:30,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:30,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:30,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:30,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:30,943 INFO L87 Difference]: Start difference. First operand 169992 states and 217094 transitions. Second operand 3 states. [2019-10-02 11:08:32,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:32,588 INFO L93 Difference]: Finished difference Result 254988 states and 324616 transitions. [2019-10-02 11:08:32,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:32,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-10-02 11:08:32,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:32,740 INFO L225 Difference]: With dead ends: 254988 [2019-10-02 11:08:32,740 INFO L226 Difference]: Without dead ends: 172042 [2019-10-02 11:08:32,798 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:32,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172042 states. [2019-10-02 11:08:37,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172042 to 172040. [2019-10-02 11:08:37,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172040 states. [2019-10-02 11:08:37,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172040 states to 172040 states and 217094 transitions. [2019-10-02 11:08:37,764 INFO L78 Accepts]: Start accepts. Automaton has 172040 states and 217094 transitions. Word has length 37 [2019-10-02 11:08:37,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:37,764 INFO L475 AbstractCegarLoop]: Abstraction has 172040 states and 217094 transitions. [2019-10-02 11:08:37,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:37,765 INFO L276 IsEmpty]: Start isEmpty. Operand 172040 states and 217094 transitions. [2019-10-02 11:08:37,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-02 11:08:37,832 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:37,832 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:37,832 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:37,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:37,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1143475054, now seen corresponding path program 1 times [2019-10-02 11:08:37,833 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:37,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:37,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:37,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:37,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:37,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:37,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:37,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:37,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:37,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:37,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:37,850 INFO L87 Difference]: Start difference. First operand 172040 states and 217094 transitions. Second operand 3 states. [2019-10-02 11:08:39,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:39,929 INFO L93 Difference]: Finished difference Result 286732 states and 366600 transitions. [2019-10-02 11:08:39,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:39,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-10-02 11:08:39,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:40,204 INFO L225 Difference]: With dead ends: 286732 [2019-10-02 11:08:40,204 INFO L226 Difference]: Without dead ends: 286730 [2019-10-02 11:08:40,237 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:40,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286730 states. [2019-10-02 11:08:45,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286730 to 262152. [2019-10-02 11:08:45,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262152 states. [2019-10-02 11:08:46,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262152 states to 262152 states and 321542 transitions. [2019-10-02 11:08:46,030 INFO L78 Accepts]: Start accepts. Automaton has 262152 states and 321542 transitions. Word has length 37 [2019-10-02 11:08:46,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:46,030 INFO L475 AbstractCegarLoop]: Abstraction has 262152 states and 321542 transitions. [2019-10-02 11:08:46,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:46,030 INFO L276 IsEmpty]: Start isEmpty. Operand 262152 states and 321542 transitions. [2019-10-02 11:08:46,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-02 11:08:46,174 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:46,174 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:46,174 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:46,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:46,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1157347536, now seen corresponding path program 1 times [2019-10-02 11:08:46,175 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:46,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:46,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:46,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:46,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:46,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:46,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:46,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:46,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:46,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:46,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:46,196 INFO L87 Difference]: Start difference. First operand 262152 states and 321542 transitions. Second operand 3 states. [2019-10-02 11:08:49,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:49,183 INFO L93 Difference]: Finished difference Result 593932 states and 727048 transitions. [2019-10-02 11:08:49,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:49,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-10-02 11:08:49,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:49,547 INFO L225 Difference]: With dead ends: 593932 [2019-10-02 11:08:49,547 INFO L226 Difference]: Without dead ends: 335882 [2019-10-02 11:08:49,710 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:49,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335882 states. [2019-10-02 11:08:58,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335882 to 335880. [2019-10-02 11:08:58,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335880 states. [2019-10-02 11:08:58,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335880 states to 335880 states and 405510 transitions. [2019-10-02 11:08:58,842 INFO L78 Accepts]: Start accepts. Automaton has 335880 states and 405510 transitions. Word has length 37 [2019-10-02 11:08:58,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:58,843 INFO L475 AbstractCegarLoop]: Abstraction has 335880 states and 405510 transitions. [2019-10-02 11:08:58,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:58,843 INFO L276 IsEmpty]: Start isEmpty. Operand 335880 states and 405510 transitions. [2019-10-02 11:08:59,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-02 11:08:59,001 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:59,001 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:59,001 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:59,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:59,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1087772454, now seen corresponding path program 1 times [2019-10-02 11:08:59,001 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:59,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:59,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:59,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:59,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:59,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:59,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:59,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:59,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:59,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:59,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:59,028 INFO L87 Difference]: Start difference. First operand 335880 states and 405510 transitions. Second operand 3 states. [2019-10-02 11:09:02,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:02,080 INFO L93 Difference]: Finished difference Result 503820 states and 606216 transitions. [2019-10-02 11:09:02,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:09:02,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-10-02 11:09:02,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:02,455 INFO L225 Difference]: With dead ends: 503820 [2019-10-02 11:09:02,456 INFO L226 Difference]: Without dead ends: 339978 [2019-10-02 11:09:02,578 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:09:02,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339978 states. [2019-10-02 11:09:11,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339978 to 339976. [2019-10-02 11:09:11,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339976 states. [2019-10-02 11:09:12,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339976 states to 339976 states and 405510 transitions. [2019-10-02 11:09:12,518 INFO L78 Accepts]: Start accepts. Automaton has 339976 states and 405510 transitions. Word has length 38 [2019-10-02 11:09:12,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:12,518 INFO L475 AbstractCegarLoop]: Abstraction has 339976 states and 405510 transitions. [2019-10-02 11:09:12,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:09:12,518 INFO L276 IsEmpty]: Start isEmpty. Operand 339976 states and 405510 transitions. [2019-10-02 11:09:12,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-02 11:09:12,681 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:12,681 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:12,681 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:12,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:12,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1518251100, now seen corresponding path program 1 times [2019-10-02 11:09:12,682 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:12,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:12,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:12,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:09:12,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:12,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:12,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:09:12,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:09:12,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:09:12,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:09:12,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:09:12,699 INFO L87 Difference]: Start difference. First operand 339976 states and 405510 transitions. Second operand 3 states. [2019-10-02 11:09:21,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:21,370 INFO L93 Difference]: Finished difference Result 557068 states and 667656 transitions. [2019-10-02 11:09:21,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:09:21,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-10-02 11:09:21,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:21,924 INFO L225 Difference]: With dead ends: 557068 [2019-10-02 11:09:21,925 INFO L226 Difference]: Without dead ends: 557066 [2019-10-02 11:09:21,980 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:09:22,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557066 states. [2019-10-02 11:09:28,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557066 to 524296. [2019-10-02 11:09:28,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524296 states. [2019-10-02 11:09:28,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524296 states to 524296 states and 610310 transitions. [2019-10-02 11:09:28,707 INFO L78 Accepts]: Start accepts. Automaton has 524296 states and 610310 transitions. Word has length 38 [2019-10-02 11:09:28,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:09:28,708 INFO L475 AbstractCegarLoop]: Abstraction has 524296 states and 610310 transitions. [2019-10-02 11:09:28,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:09:28,708 INFO L276 IsEmpty]: Start isEmpty. Operand 524296 states and 610310 transitions. [2019-10-02 11:09:30,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-02 11:09:30,366 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:09:30,366 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:09:30,366 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:09:30,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:09:30,367 INFO L82 PathProgramCache]: Analyzing trace with hash -475893606, now seen corresponding path program 1 times [2019-10-02 11:09:30,367 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:09:30,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:09:30,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:30,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:09:30,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:09:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:09:30,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:09:30,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:09:30,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:09:30,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:09:30,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:09:30,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:09:30,381 INFO L87 Difference]: Start difference. First operand 524296 states and 610310 transitions. Second operand 3 states. [2019-10-02 11:09:42,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:09:42,789 INFO L93 Difference]: Finished difference Result 1179660 states and 1363976 transitions. [2019-10-02 11:09:42,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:09:42,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-10-02 11:09:42,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:09:43,401 INFO L225 Difference]: With dead ends: 1179660 [2019-10-02 11:09:43,402 INFO L226 Difference]: Without dead ends: 663562 [2019-10-02 11:09:43,577 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:09:43,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663562 states. [2019-10-02 11:09:58,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663562 to 663560. [2019-10-02 11:09:58,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663560 states. [2019-10-02 11:10:08,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663560 states to 663560 states and 753670 transitions. [2019-10-02 11:10:08,224 INFO L78 Accepts]: Start accepts. Automaton has 663560 states and 753670 transitions. Word has length 38 [2019-10-02 11:10:08,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:10:08,224 INFO L475 AbstractCegarLoop]: Abstraction has 663560 states and 753670 transitions. [2019-10-02 11:10:08,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:10:08,224 INFO L276 IsEmpty]: Start isEmpty. Operand 663560 states and 753670 transitions. [2019-10-02 11:10:08,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-02 11:10:08,573 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:10:08,573 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:10:08,574 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:10:08,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:10:08,574 INFO L82 PathProgramCache]: Analyzing trace with hash -178639963, now seen corresponding path program 1 times [2019-10-02 11:10:08,574 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:10:08,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:10:08,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:10:08,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:10:08,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:10:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:10:08,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:10:08,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:10:08,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:10:08,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:10:08,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:10:08,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:10:08,590 INFO L87 Difference]: Start difference. First operand 663560 states and 753670 transitions. Second operand 3 states. [2019-10-02 11:10:19,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:10:19,133 INFO L93 Difference]: Finished difference Result 995340 states and 1126408 transitions. [2019-10-02 11:10:19,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:10:19,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-02 11:10:19,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:10:19,842 INFO L225 Difference]: With dead ends: 995340 [2019-10-02 11:10:19,842 INFO L226 Difference]: Without dead ends: 671754 [2019-10-02 11:10:20,015 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:10:20,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671754 states. [2019-10-02 11:10:39,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671754 to 671752. [2019-10-02 11:10:39,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671752 states. [2019-10-02 11:10:40,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671752 states to 671752 states and 753670 transitions. [2019-10-02 11:10:40,199 INFO L78 Accepts]: Start accepts. Automaton has 671752 states and 753670 transitions. Word has length 39 [2019-10-02 11:10:40,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:10:40,199 INFO L475 AbstractCegarLoop]: Abstraction has 671752 states and 753670 transitions. [2019-10-02 11:10:40,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:10:40,199 INFO L276 IsEmpty]: Start isEmpty. Operand 671752 states and 753670 transitions. [2019-10-02 11:10:41,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-02 11:10:41,563 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:10:41,563 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:10:41,563 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:10:41,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:10:41,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1867583705, now seen corresponding path program 1 times [2019-10-02 11:10:41,563 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:10:41,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:10:41,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:10:41,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:10:41,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:10:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:10:41,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:10:41,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:10:41,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:10:41,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:10:41,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:10:41,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:10:41,579 INFO L87 Difference]: Start difference. First operand 671752 states and 753670 transitions. Second operand 3 states. [2019-10-02 11:10:55,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:10:55,321 INFO L93 Difference]: Finished difference Result 1081354 states and 1204231 transitions. [2019-10-02 11:10:55,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:10:55,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-02 11:10:55,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:10:56,915 INFO L225 Difference]: With dead ends: 1081354 [2019-10-02 11:10:56,915 INFO L226 Difference]: Without dead ends: 1081352 [2019-10-02 11:10:57,004 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:10:57,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081352 states. [2019-10-02 11:11:22,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081352 to 1048584. [2019-10-02 11:11:22,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048584 states. [2019-10-02 11:11:25,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048584 states to 1048584 states and 1155078 transitions. [2019-10-02 11:11:25,841 INFO L78 Accepts]: Start accepts. Automaton has 1048584 states and 1155078 transitions. Word has length 39 [2019-10-02 11:11:25,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:11:25,842 INFO L475 AbstractCegarLoop]: Abstraction has 1048584 states and 1155078 transitions. [2019-10-02 11:11:25,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:11:25,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1048584 states and 1155078 transitions. [2019-10-02 11:11:26,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-02 11:11:26,449 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:11:26,450 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:11:26,450 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:11:26,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:11:26,450 INFO L82 PathProgramCache]: Analyzing trace with hash 433238885, now seen corresponding path program 1 times [2019-10-02 11:11:26,450 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:11:26,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:11:26,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:11:26,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:11:26,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:11:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:11:26,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:11:26,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:11:26,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:11:26,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:11:26,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:11:26,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:11:26,474 INFO L87 Difference]: Start difference. First operand 1048584 states and 1155078 transitions. Second operand 3 states. [2019-10-02 11:11:46,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:11:46,319 INFO L93 Difference]: Finished difference Result 2342920 states and 2547718 transitions. [2019-10-02 11:11:46,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:11:46,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-02 11:11:46,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:11:46,320 INFO L225 Difference]: With dead ends: 2342920 [2019-10-02 11:11:46,320 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 11:11:48,293 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:11:48,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 11:11:48,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 11:11:48,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 11:11:48,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 11:11:48,295 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2019-10-02 11:11:48,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:11:48,295 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 11:11:48,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:11:48,295 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 11:11:48,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 11:11:48,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 11:11:48,394 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-02 11:11:48,395 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:11:48,395 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:11:48,395 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-02 11:11:48,395 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:11:48,395 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:11:48,395 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 233) no Hoare annotation was computed. [2019-10-02 11:11:48,395 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-10-02 11:11:48,395 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 54 228) no Hoare annotation was computed. [2019-10-02 11:11:48,396 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 54 228) no Hoare annotation was computed. [2019-10-02 11:11:48,396 INFO L443 ceAbstractionStarter]: For program point L218-1(lines 54 228) no Hoare annotation was computed. [2019-10-02 11:11:48,396 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 54 228) no Hoare annotation was computed. [2019-10-02 11:11:48,396 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-10-02 11:11:48,396 INFO L443 ceAbstractionStarter]: For program point L103-1(lines 54 228) no Hoare annotation was computed. [2019-10-02 11:11:48,396 INFO L443 ceAbstractionStarter]: For program point L219(line 219) no Hoare annotation was computed. [2019-10-02 11:11:48,396 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 54 228) no Hoare annotation was computed. [2019-10-02 11:11:48,396 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 233) no Hoare annotation was computed. [2019-10-02 11:11:48,396 INFO L443 ceAbstractionStarter]: For program point L203-1(lines 54 228) no Hoare annotation was computed. [2019-10-02 11:11:48,397 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2019-10-02 11:11:48,397 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-10-02 11:11:48,397 INFO L443 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-10-02 11:11:48,397 INFO L443 ceAbstractionStarter]: For program point L188-1(lines 54 228) no Hoare annotation was computed. [2019-10-02 11:11:48,397 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2019-10-02 11:11:48,397 INFO L443 ceAbstractionStarter]: For program point L139-1(lines 54 228) no Hoare annotation was computed. [2019-10-02 11:11:48,397 INFO L443 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-10-02 11:11:48,397 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 54 228) no Hoare annotation was computed. [2019-10-02 11:11:48,397 INFO L443 ceAbstractionStarter]: For program point L173-1(lines 54 228) no Hoare annotation was computed. [2019-10-02 11:11:48,398 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 54 228) no Hoare annotation was computed. [2019-10-02 11:11:48,398 INFO L446 ceAbstractionStarter]: At program point L223-1(lines 54 228) the Hoare annotation is: true [2019-10-02 11:11:48,398 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2019-10-02 11:11:48,398 INFO L443 ceAbstractionStarter]: For program point L91-2(lines 54 228) no Hoare annotation was computed. [2019-10-02 11:11:48,398 INFO L443 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-10-02 11:11:48,398 INFO L443 ceAbstractionStarter]: For program point L224(line 224) no Hoare annotation was computed. [2019-10-02 11:11:48,398 INFO L439 ceAbstractionStarter]: At program point L224-1(lines 5 233) the Hoare annotation is: false [2019-10-02 11:11:48,398 INFO L443 ceAbstractionStarter]: For program point L158-1(lines 54 228) no Hoare annotation was computed. [2019-10-02 11:11:48,399 INFO L443 ceAbstractionStarter]: For program point L208-1(lines 54 228) no Hoare annotation was computed. [2019-10-02 11:11:48,399 INFO L443 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-10-02 11:11:48,399 INFO L443 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2019-10-02 11:11:48,399 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 54 228) no Hoare annotation was computed. [2019-10-02 11:11:48,399 INFO L443 ceAbstractionStarter]: For program point L193-1(lines 54 228) no Hoare annotation was computed. [2019-10-02 11:11:48,399 INFO L443 ceAbstractionStarter]: For program point L127-1(lines 54 228) no Hoare annotation was computed. [2019-10-02 11:11:48,399 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 54 228) no Hoare annotation was computed. [2019-10-02 11:11:48,399 INFO L443 ceAbstractionStarter]: For program point L194(line 194) no Hoare annotation was computed. [2019-10-02 11:11:48,399 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 54 228) no Hoare annotation was computed. [2019-10-02 11:11:48,399 INFO L443 ceAbstractionStarter]: For program point L178-1(lines 54 228) no Hoare annotation was computed. [2019-10-02 11:11:48,399 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 233) the Hoare annotation is: true [2019-10-02 11:11:48,400 INFO L443 ceAbstractionStarter]: For program point L179(line 179) no Hoare annotation was computed. [2019-10-02 11:11:48,400 INFO L446 ceAbstractionStarter]: At program point L229(lines 5 233) the Hoare annotation is: true [2019-10-02 11:11:48,400 INFO L443 ceAbstractionStarter]: For program point L163-1(lines 54 228) no Hoare annotation was computed. [2019-10-02 11:11:48,400 INFO L443 ceAbstractionStarter]: For program point L213-1(lines 54 228) no Hoare annotation was computed. [2019-10-02 11:11:48,400 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 54 228) no Hoare annotation was computed. [2019-10-02 11:11:48,400 INFO L443 ceAbstractionStarter]: For program point L164(line 164) no Hoare annotation was computed. [2019-10-02 11:11:48,400 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 54 228) no Hoare annotation was computed. [2019-10-02 11:11:48,400 INFO L443 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2019-10-02 11:11:48,400 INFO L443 ceAbstractionStarter]: For program point L115-1(lines 54 228) no Hoare annotation was computed. [2019-10-02 11:11:48,401 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 54 228) no Hoare annotation was computed. [2019-10-02 11:11:48,401 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 54 228) no Hoare annotation was computed. [2019-10-02 11:11:48,401 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-10-02 11:11:48,401 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 54 228) no Hoare annotation was computed. [2019-10-02 11:11:48,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:11:48 BoogieIcfgContainer [2019-10-02 11:11:48,409 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 11:11:48,412 INFO L168 Benchmark]: Toolchain (without parser) took 229692.37 ms. Allocated memory was 140.5 MB in the beginning and 4.7 GB in the end (delta: 4.5 GB). Free memory was 88.1 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 3.4 GB. Max. memory is 7.1 GB. [2019-10-02 11:11:48,413 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 140.5 MB. Free memory was 106.5 MB in the beginning and 106.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 11:11:48,414 INFO L168 Benchmark]: CACSL2BoogieTranslator took 411.95 ms. Allocated memory was 140.5 MB in the beginning and 200.8 MB in the end (delta: 60.3 MB). Free memory was 87.9 MB in the beginning and 178.1 MB in the end (delta: -90.2 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-10-02 11:11:48,415 INFO L168 Benchmark]: Boogie Preprocessor took 40.11 ms. Allocated memory is still 200.8 MB. Free memory was 178.1 MB in the beginning and 176.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-10-02 11:11:48,415 INFO L168 Benchmark]: RCFGBuilder took 493.56 ms. Allocated memory is still 200.8 MB. Free memory was 176.2 MB in the beginning and 152.4 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. [2019-10-02 11:11:48,416 INFO L168 Benchmark]: TraceAbstraction took 228742.72 ms. Allocated memory was 200.8 MB in the beginning and 4.7 GB in the end (delta: 4.5 GB). Free memory was 151.8 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 3.4 GB. Max. memory is 7.1 GB. [2019-10-02 11:11:48,420 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.21 ms. Allocated memory is still 140.5 MB. Free memory was 106.5 MB in the beginning and 106.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 411.95 ms. Allocated memory was 140.5 MB in the beginning and 200.8 MB in the end (delta: 60.3 MB). Free memory was 87.9 MB in the beginning and 178.1 MB in the end (delta: -90.2 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.11 ms. Allocated memory is still 200.8 MB. Free memory was 178.1 MB in the beginning and 176.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 493.56 ms. Allocated memory is still 200.8 MB. Free memory was 176.2 MB in the beginning and 152.4 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 228742.72 ms. Allocated memory was 200.8 MB in the beginning and 4.7 GB in the end (delta: 4.5 GB). Free memory was 151.8 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 3.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 231]: 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 - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 59 locations, 1 error locations. SAFE Result, 228.6s OverallTime, 43 OverallIterations, 1 TraceHistogramMax, 91.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5309 SDtfs, 2663 SDslu, 3669 SDs, 0 SdLazy, 229 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1048584occurred in iteration=42, 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: 129.8s AutomataMinimizationTime, 43 MinimizatonAttempts, 131120 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 32778 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1382 NumberOfCodeBlocks, 1382 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1339 ConstructedInterpolants, 0 QuantifiedInterpolants, 89720 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 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...